PAT 甲级 1003 Emergency (25分)

题目

1003 Emergency (25分)

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 Specification:

Each input file contains one test case. For each test case, the first line contains 4 positive integers: $N(\le 500)$ - the number of cities (and the cities are numbered from 0 to $N-1)$, $M$ - the number of roads, $C_{1}and{C}_2$ - 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 $c_1,c_2$​ 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 $C_1$ to $C_2$.

Output Specification:

For each test case, print in one line two numbers: the number of different shortest paths between $C_{1}and{C}_2$, 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:

5 6 0 2
1 2 1 5 3
0 1 1
0 2 2
0 3 1
1 2 1
2 4 1
3 4 1

Sample Output:

2 4

题目大意

给出N个城市的救援队数量，M条城市之间的路，求出最短路径条数和一条路径能够得到的最多救援队数量。

思路

Dijkstra算法

代码

#include <bits/stdc++.h>
using namespace std;
const int inf = 1e7;
int main(int argc, const char * argv[]) {
    int N, M, C1, C2, a, b, dis;
    scanf("%d%d%d%d",&N,&M,&C1,&C2);
    vector<int> teams(N), collect(N,0);
    int edge[510][510];
    fill(edge[0], edge[0]+510*510, -1);
    for(int i=0; i<N; i++)
        scanf("%d",&teams[i]);
    for(int i=0; i<M; i++){
        scanf("%d%d%d",&a,&b,&dis);
        edge[a][b] = dis;
        edge[b][a] = dis;
    }
    vector<int> Dist(N, inf);
    vector<int> path(N, 0);
    vector<bool> Visit(N, false);
    Dist[C1] = 0;
    path[C1] = 1;
    collect[C1] = teams[C1];
    for(int i=0; i<N; i++){
        int u = -1;
        int mindis = inf;
        for(int j=0; j<N; j++){
            if(!Visit[j] && Dist[j] < mindis){
                u = j;
                mindis = Dist[j];
            }
        }
        if(u == -1) break;
        Visit[u] = true;
        for(int k=0; k<N; k++){
            if(!Visit[k] && edge[u][k] != -1){
                if(edge[u][k] + Dist[u] < Dist[k]){
                    Dist[k] = edge[u][k] + Dist[u]; // 更新最短距离
                    collect[k] = collect[u] + teams[k]; // 更新救援队数
                    path[k] = path[u]; //更新路径数量
                }else if(edge[u][k] + Dist[u] == Dist[k]){
                    path[k] += path[u];
                    collect[k] = max(collect[k], teams[k] + collect[u]);
                }
            }
        }
    }
    printf("%d %d",path[C2], collect[C2]);
    return 0;
}