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 (≤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




分析：水题。。Dijkstra模板套上就OK了，另外增加第二标尺、第三标尺时，初始化不能忘！

 1 /**
 2 * Copyright(c)
 3 * All rights reserved.
 4 * Author : Mered1th
 5 * Date : 2019-02-22-17.23.41
 6 * Description : A1003
 7 */
 8 #include<cstdio>
 9 #include<cstring>
10 #include<iostream>
11 #include<cmath>
12 #include<algorithm>
13 #include<string>
14 #include<unordered_set>
15 #include<map>
16 #include<vector>
17 #include<set>
18 using namespace std;
19 const int maxn=510;
20 const int INF=1000000000;
21 int n,m,st,ed;
22 int d[maxn],G[maxn][maxn],weight[maxn],num[maxn]={0},w[maxn]={0};
23 bool vis[maxn]={false};
24 void Dijkstra(int s){
25     fill(d,d+maxn,INF);
26     d[s]=0;
27     w[s]=weight[s];
28     num[s]=1;     //这里初始化不能忘记！
29     for(int i=0;i<n;i++){
30         int u=-1,MIN=INF;
31         for(int j=0;j<n;j++){
32             if(vis[j]==false && d[j]<MIN){
33                 u=j;
34                 MIN=d[j];
35             }
36         }
37         if(u==-1) return;
38         vis[u]=true;
39         for(int v=0;v<n;v++){
40             if(G[u][v]!=INF && vis[v]==false){
41                 if(d[u]+G[u][v]<d[v]){
42                     d[v]=d[u]+G[u][v];
43                     num[v]=num[u];
44                     w[v]=w[u]+weight[v];
45                 }
46                 else if(d[u]+G[u][v]==d[v]){
47                     if(w[v]<w[u]+weight[v]){
48                         w[v]=w[u]+weight[v];
49                     }
50                     num[v] += num[u];  //最短路径条数与点权无关，写在外面！
51                 }
52             }
53         }
54     }
55 }
56 
57 int main(){
58 #ifdef ONLINE_JUDGE
59 #else
60     freopen("1.txt", "r", stdin);
61 #endif
62     cin>>n>>m>>st>>ed;
63     fill(G[0],G[0]+maxn*maxn,INF);
64     for(int i=0;i<n;i++){
65         scanf("%d",&weight[i]);
66     }
67     int a,b,t;
68     for(int i=0;i<m;i++){
69         scanf("%d%d%d",&a,&b,&t);
70         G[a][b]=G[b][a]=t;
71     }
72     Dijkstra(st);
73     printf("%d %d\n",num[ed],w[ed]);
74     return 0;
75 }

 

转载于:https://www.cnblogs.com/Mered1th/p/10419841.html