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
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
解题思路:最短路径的加强版,需要记录最短路径的数量,及最大权重,根据别人的代码写出来的。
#include<iostream>
using namespace std;
#define INF 999999
#define MX 501
//记录两个点之间的距离
int mp[MX][MX];
//标记各个点是否被访问过
int v[MX];
//记录从起始点到点i的距离
int dist[MX];
//记录从起始点到当前点的最大队伍数量
int amount[MX];
//记录每个城市的队伍数量
int teams[MX];
//记录从起始点到当前点的最短路径数量
int pathcount[MX];
int N, M, start, en;
void dijkstra(int s){
//
amount[s] = teams[s];
dist[s] = 0;
pathcount[s] = 1;
while (1){
int u,dmin = INF;
//都是从0开始,因为第一遍循环会把起始点找出来
for (int i = 0; i < N; i++){
if (v[i] == 0 && dist[i] < dmin){
dmin = dist[i];
u = i;
}
}
//dmin==INF表示所有点已经都遍历过了
if (dmin == INF)
break;
//将找到的点标记一下,说明这个点已经访问过,之后就不要访问了
v[u] = 1;
for (int i = 0; i < N; i++){
if (v[i] == 0){
//经过当前点到达距离可以更近
if (dist[i] > dist[u] + mp[u][i]){
//更新距离
dist[i] = dist[u] + mp[u][i];
//到达新的点的队伍数量也进行更新
amount[i] = amount[u] + teams[i];
/*到达新的路径点的数量就等于上一个点的数量,因为是>号,所以找不到
从其他点过来多条路径*/
pathcount[i] = pathcount[u];
}
else if (dist[i] == dist[u] + mp[u][i]){
//如果距离相等就,到达当前的最短路径数就加1
pathcount[i] += pathcount[u];
//如果之前的最大队伍数量小于现在的队伍数量,则进行更新
if (amount[i] < amount[u] + teams[i]){
amount[i] = amount[u] + teams[i];
}
}
}
}
}
}
int main(){
for (; scanf("%d%d%d%d", &N, &M, &start, &en) != EOF;){
for (int i = 0; i < N; i++){
scanf("%d", &teams[i]);
}
for (int i = 0; i < N; i++){
dist[i] = INF;
for (int j = 0; j < N; j++){
mp[i][j] = INF;
}
}
for (int i = 0; i < M; i++){
int c1, c2, L;
scanf("%d%d%d", &c1, &c2, &L);
mp[c1][c2] = mp[c2][c1] = L;
}
dijkstra(start);
printf("%d %d\n", pathcount[en], amount[en]);
}
return 0;
}