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, 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 Specification:
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
利用dijkstra算法的变形,在初始化的时候须将起点的路径长度,到达起点的路径的数目以及在起点能够召集到的救援的数量都进行初始化
满分代码如下:
#include<bits/stdc++.h>
using namespace std;
const int N=505;
const int inf = 0x3f3f3f3f;
struct edge{
int v,len;
};
vector<edge>graph[N];
int num[N],dst[N],vst[N];//每个城市的救援队的数量,到达每个城市的最短路径
int n,m,start,en;
int path[N],people[N];//到达某个城市的最短路径的数量,到达某个城市的人员
void dijkstra(){
for(int i=0;i<n;i++){
dst[i]=inf;
vst[i] = 0;
}
dst[start] = 0;
for(int i = 0;i < n;i++){
int v = -1, min_dst = inf;
for(int j = 0;j < n;j++){
if(dst[j]<min_dst&&!vst[j]){
v=j;
min_dst=dst[j];
}
}
if(v==-1) return;
vst[v]=1;
for(auto j:graph[v]){
if(dst[v]+j.len<dst[j.v]&&!vst[j.v]){
dst[j.v]=dst[v]+j.len;
path[j.v]=path[v];//更新最短路径的数量
people[j.v]=people[v]+num[j.v];//人数相加
}else if(dst[v]+j.len==dst[j.v]&&!vst[j.v]){
path[j.v]+=path[v];//更新最短路径的数量
people[j.v]=max(people[j.v],people[v]+num[j.v]);//人数更新
}
}
}
}
int main(){
scanf("%d%d%d%d",&n,&m,&start,&en);
for(int i = 0;i < n;i++)
scanf("%d",&num[i]);
for(int i = 0;i < m;i++){
int u,v,len;
scanf("%d%d%d",&u,&v,&len);
graph[u].push_back({v,len});
graph[v].push_back({u,len});
}
path[start]=1;//起点的最短路径为1;
people[start]=num[start];
dijkstra();
printf("%d %d\n",path[en],people[en]);
return 0;
}