#include <cstdio>
#include <algorithm>
using namespace std;
int N, M, C1, C2, inf = 1000000000;
int dis[510], G[510][510] = {0}, visited[510] = {0}, cnt[510], teams[510], total[510];
int main(){
scanf("%d%d%d%d", &N, &M, &C1, &C2);
for(int i = 0; i < N; i++)
scanf("%d", &teams[i]);
for(int i = 0; i < M; i++){
int f, t, distance;
scanf("%d%d%d", &f, &t, &distance);
G[f][t] = G[t][f] = distance;
}
fill(dis, dis + N, inf);
dis[C1] = 0;cnt[C1] = 1;total[C1] = teams[C1];
for(int i = 0; i < N; i++){
//找距离C1最短的点
int min = inf, index = -1;
for(int j = 0; j < N; j++){
if(visited[j] == 0 && dis[j] < min){
min = dis[j];
index = j;
}
}
if(index == -1)
break;
visited[index] = 1;//访问这个距离最短的点
//更新图内点到C1的距离
for(int j = 0; j < N; j++){
//首先要index到该点有路
if(G[index][j] != 0){
//路径长度比之前要短
if(dis[index] + G[index][j] < dis[j]){
dis[j] = dis[index] + G[index][j];
total[j] = total[index] + teams[j];//将前驱的总医疗队数量加到该点
cnt[j] = cnt[index];//到该点的路径数就是到前驱的路径数
}
//发现了路径长度相同的
else if(dis[index] + G[index][j] == dis[j]){
total[j] = max(total[j], total[index] + teams[j]);//将该点医疗队数量改成最大的那种
cnt[j] += cnt[index];//到该点的路径数是当前的路径数加上前驱结点的路径数
}
}
}
}
printf("%d %d\n", cnt[C2], total[C2]);
return 0;
}
【PAT A1003】Emergency
最新推荐文章于 2022-04-16 22:34:13 发布