1003 Emergency

1003 Emergency

分数 25

作者 CHEN, Yue

单位 浙江大学

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

题目大意：一共有n座城市，每个城市都部署有救援队，现在已知m条边的起点、终点、路径，以及现在的出发点和目的地，需求出这两点的最短路径的条数，以及最多能得到的救援队的数量

通过dijikstra算法求最短路径，并开两个数组，来分别储存每个点所能得到的最大救援队的数量和最短路径的条数 

#include<bits/stdc++.h>
using namespace std;
const int INF=0x3f3f3f3f;
int vis[550];
int dis[550];
int side[550][550];
int save[550];
int road[550];
int allsave[550];
int main()
{
	int n,m,c1,c2;
	while(~scanf("%d %d %d %d",&n,&m,&c1,&c2))
	{
		memset(vis,0,sizeof(vis));
		memset(allsave,0,sizeof(allsave));
		memset(road,0,sizeof(road));
		fill(dis,dis+550,INF);
		fill(side[0],side[0]+550*550,INF);
		for(int i=0;i<n;i++)
		scanf("%d",&save[i]);
		for(int i=0;i<m;i++)
		{
			int x,y,z;
			scanf("%d %d %d",&x,&y,&z);
			side[x][y]=z;
			side[y][x]=z;
		}
		allsave[c1]=save[c1];
		dis[c1]=0;
		road[c1]=1;
		for(int i=0;i<n;i++)
		{
			int s=-1;
			int minn=INF;
			for(int j=0;j<n;j++)
			{
				if(!vis[j]&&dis[j]<minn)
				{
					s=j;
					minn=dis[j];
				}
			}
			if(s==-1)
			break;
			vis[s]=1;
			for(int j=0;j<n;j++)
			{
				if(!vis[j]&&side[s][j]!=INF)
				{
					if(dis[s]+side[s][j]<dis[j])
					{
						dis[j]=dis[s]+side[s][j];
						road[j]=road[s];
						allsave[j]=save[j]+allsave[s];
					}
					else if(dis[s]+side[s][j]==dis[j])
					{
						road[j]+=road[s];
						if(allsave[s]+save[j]>allsave[j])
						allsave[j]=allsave[s]+save[j];
					}
				}
			}
		}
		printf("%d %d\n",road[c2],allsave[c2]);
	}
	return 0;
}