1003. Emergency (25)
2016-02-18 10:16
351 查看
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
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
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
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
#include <cstdio> #define MAX 500 #define INF 999999999 int dist[MAX]; bool mark[MAX]; int mp[MAX][MAX]; int teams[MAX]; int amount[MAX]; int pathcount[MAX]; int n, m, start, en; void dijkstra(int s){ dist[s] = 0; amount[s] = teams[s]; mark[s] = true; int newP = s; while (newP != en){ for (int i = 0; i < n; i++){ if (mark[i] == false){ if (dist[i] > dist[newP] + mp[newP][i]){ dist[i] = dist[newP] + mp[newP][i]; amount[i] = amount[newP] + teams[i]; pathcount[i] = pathcount[newP]; } else if (dist[i] == dist[newP] + mp[newP][i]){ pathcount[i] += pathcount[newP]; if (amount[i] < amount[newP] + teams[i]) amount[i] = amount[newP] + teams[i]; } } } int dmin = INF; for (int i = 0; i < n; i++){ if (mark[i] == false && dist[i] < dmin){ dmin = dist[i]; newP = i; } } mark[newP] = true; } } int main(){ scanf("%d%d%d%d", &n, &m, &start, &en); for (int i = 0; i < n; i++){ scanf("%d", &teams[i]); } for (int i = 0; i < n; i++){ dist[i] = INF; pathcount[i] = 1; mark[i] = false; for (int j = 0; j < n; j++) mp[i][j] = INF; } for (int i = 0; i < m; i++){ int c1, c2, L; scanf("%d%d%d", &c1, &c2, &L); mp[c1][c2] = mp[c2][c1] = L; } dijkstra(start); printf("%d %d\n", pathcount[en], amount[en]); return 0; }
相关文章推荐
- Git配置默认pull、push地址
- tomcat跨服务器传文件
- fwide Function
- 小巧的UML工具-UMLet
- HTML5:基本使用
- MVC模式与三层架构的区别
- ubuntu 下查看caj文件
- Struts2 指定页面返回
- hdu acm 1147 Pick-up sticks(判断线段相交)
- Python 实用技巧
- 在iOS系统上设计用户登录(原创技巧)
- Android在Eclipse上进行开发时分包
- 笔记6,使用jQuery操作DOM
- MongoDB是?
- 转 Selenium+Python+Eclipse网页自动化集成环境配置(附简单的测试程序)
- Handler本质简析与使用实例
- ASP.NET 执行bat文件。
- 软件发布版本区别介绍-Alpha,Beta,RC,Release
- 如何让网页显示友好的错误信息页面
- 为什么Java 两个Integer 中1000==1000为false而100==100为true?