1003. Emergency (25)-PAT
来源:互联网 发布:淘宝卖瑕疵大牌化妆品 编辑:程序博客网 时间:2024/05/16 17:17
1003. Emergency (25)
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.
5 6 0 21 2 1 5 30 1 10 2 20 3 11 2 12 4 13 4 1Sample Output
2 4
迪杰特拉斯最短路径
#include<iostream>#define max(a,b) ((a)>(b)?(a):(b))using namespace std;#define N 1000int mapt[N][N];int dist[N];int visit[N];int team[N];int total[N];int num_path[N];#define maxnum 0xfffffffvoid 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;}
- 1003. Emergency (25)-PAT
- (PAT)1003. Emergency (25)
- PAT 1003. Emergency (25)
- PAT 1003. Emergency (25)
- [PAT]1003. Emergency (25)
- 【PAT】1003. Emergency (25)
- PAT 1003. Emergency (25)
- PAT 1003. Emergency (25)
- PAT 1003. Emergency (25)
- 【PAT】1003. Emergency (25)
- PAT 1003. Emergency (25)
- pat 1003. Emergency (25)
- PAT:1003. Emergency (25)
- PAT:1003. Emergency (25)
- 【PAT】1003. Emergency (25)
- pat 1003. Emergency (25)
- PAT 1003. Emergency (25)
- PAT --- 1003. Emergency (25)
- IP地址的分类——a,b,c 类是如何划分的
- Silverlight WCF RIA服务(十七)数据 7
- 【分享】一位技术人员成长历程
- PHP Cookies
- Linux中的yum是什么?如何配置?如何使用?
- 1003. Emergency (25)-PAT
- JQuery 登录窗口_后面窗口锁定
- Android调用WebService(图文教程)
- U_BOOT_CMD命令的实现
- MVC的发展
- Android布局的小撇步
- SELECT INTO 和 INSERT INTO SELECT
- VMware虚拟机上网络连接(network type)的三种模式--bridged、host-only、NAT
- CRAMFS制作方法