PAT 1003. Emergency C语言

紧急救援路线规划

最新推荐文章于 2021-03-06 15:50:22 发布

原创最新推荐文章于 2021-03-06 15:50:22 发布 · 508 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT #源码 #c语言

PAT 专栏收录该内容

14 篇文章

订阅专栏

本文介绍了一个基于Dijkstra算法的城市间紧急救援路线规划问题。输入包括城市数量、道路连接及长度等信息，目标是最短时间到达指定城市并尽可能多地召集救援队伍。

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked on the map. When there is an emergency call to you from some other city, your job is to lead your men to the place as quickly as possible, and at the mean time, call up as many hands on the way as possible.

Input

Each input file contains one test case. For each test case, the first line contains 4 positive integers: N (<= 500) - the number of cities (and the cities are numbered from 0 to N-1), M - the number of roads, C1 and C2 - the cities that you are currently in and that you must save, respectively. The next line contains N integers, where the i-th integer is the number of rescue teams in the i-th city. Then M lines follow, each describes a road with three integers c1, c2 and L, which are the pair of cities connected by a road and the length of that road, respectively. It is guaranteed that there exists at least one path from C1 to C2.

Output

For each test case, print in one line two numbers: the number of different shortest paths between C1 and C2, and the maximum amount of rescue teams you can possibly gather.
All the numbers in a line must be separated by exactly one space, and there is no extra space allowed at the end of a line.

Sample Input

Sample Output

2 4

单源最短路径 Dijkstra算法

#include <stdio.h>
#define maxint 1<<28
int main(void){
    int n,m,c1,c2;
    scanf("%d%d%d%d",&n,&m,&c1,&c2);
    int i,j;
    int t[510],a[510]={0};
    int d[510],w[510]={0},v[510]={0};
    for (i=0;i<n;i++){
        scanf("%d",&t[i]);
        d[i]=maxint;
    }
    int r[500][500];
    int x,y;
    for (i=0;i<n;i++){
        for (j=0;j<n;j++){
            r[i][j]=-1;
        }
    }
    for (i=0;i<m;i++){
        scanf("%d%d",&x,&y);
        scanf("%d",&r[x][y]);
        r[y][x]=r[x][y];
    }
    
    d[c1]=0;
    a[c1]=t[c1];
    w[c1]=1;
    
    for (i=0;i<n;i++){
        int minn=maxint,min;
        for (j=0;j<n;j++){
            if ((d[j]<minn)&&(v[j]==0)){
                min=j;
                minn=d[j];
            }
        }
        if (minn==maxint) break;
        v[min]=1;
        
        for (j=0;j<n;j++)
            if ((v[j]==0)&&(r[j][min]!=-1)){
                if (d[j]>d[min]+r[j][min]){
                    d[j]=d[min]+r[j][min];
                    w[j]=w[min];
                    a[j]=a[min]+t[j];
                }
                else if (d[j]==d[min]+r[j][min]){
                    w[j]+=w[min];
                    if (a[j]<a[min]+t[j]) a[j]=a[min]+t[j];
                }
                
            }
        if (min==c2) break;
    }

    printf("%d %d\n",w[c2],a[c2]);
}