1003. Emergency (25)-PAT

最新推荐文章于 2021-03-06 15:50:22 发布

原创最新推荐文章于 2021-03-06 15:50:22 发布 · 1.7k 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 2 个专栏收录

130 篇文章

订阅专栏

ACM/POJ/PAT/九度

130 篇文章

订阅专栏

本文介绍了一种紧急救援场景下的最短路径算法实现。通过给定的城市地图信息，包括城市间道路长度及各城市救援队伍数量，算法能够找出从当前城市到目标城市的最短路径及其能集结的最大救援队伍数量。

1003. Emergency (25)

时间限制

400 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

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

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

Sample Output

2 4

迪杰特拉斯最短路径

#include<iostream>
#define max(a,b) ((a)>(b)?(a):(b))
using namespace std;
#define N 1000
int mapt[N][N];
int dist[N];
int visit[N];
int team[N];
int total[N];
int num_path[N];
#define  maxnum 0xfffffff
void  emergency(int n,int s)
{
    int i,j,k,preteams,u;
    for(i=0;i<n;i++){
        visit[i]=0;
		dist[i]=maxnum;
        total[i]=team[i];
		dist[i]=mapt[s][i];
    }
	dist[s]=0;
	total[s]=team[s];
	preteams=total[s];
    visit[s]=1;
    for(i=0;i<n;i++)
	{
		int tmp=maxnum;
		for(j=0;j<n;j++){
			if(visit[j]==0&&dist[j]<tmp)
			{
				tmp=dist[j];
				u=j;
			}
		}
		visit[u]=1;
		for(j=0;j<n;j++){
			if(visit[j]==0&&mapt[u][j]!=maxnum){
				if(dist[j]>dist[u]+mapt[u][j])
				{   
					dist[j]=dist[u]+mapt[u][j];
					total[j]=total[u]+team[j];
					num_path[j]=num_path[u];
				}
			   else if(dist[j]==dist[u]+mapt[u][j])
				{
					total[j]=max(total[j],total[u]+team[j]);
					if(mapt[s][u]!=0)
						num_path[j]+=num_path[u];
				}
			}

		}
    }
}
int main()
{
    int i,j,k;
	int n,c1,c2;
	long m;
    cin>>n;
    cin>>m;
    cin>>c1;
    cin>>c2;
    for(i=0;i<n;i++){
        for(j=0;j<n;j++)
        {
            mapt[i][j]=maxnum;
        }
		mapt[i][i]=0;
	}
    for(i=0;i<n;i++){
       cin>> team[i];
	   num_path[i]=1;
    }
    for(k=0;k<m;k++){
        cin>>i;
        cin>>j;
        cin>>mapt[i][j];
        mapt[j][i]=mapt[i][j];
    }
    emergency(n,c1);
	if(c1!=c2){
		total[c2]+=total[c1];
	}
    cout<<num_path[c2]<<" "<<total[c2]<<endl;
    return 0;

}