PAT 甲级 1003. Emergency (25)
来源:互联网 发布:淘宝网无线端装修 编辑:程序博客网 时间:2024/05/20 16:00
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>#include<cstdio>using namespace std;int n, m, c1, c2;int e[510][510],weight[510], dis[510], num[510], w[510];bool vis[510] = { false };const int inf = 99999999;int main() {scanf("%d%d%d%d", &n, &m, &c1, &c2);for (int i = 0; i < n; i++) {scanf("%d", &weight[i]);}fill(e[0], e[0] + 510 * 510, inf);fill(dis, dis + 510, inf);int a, b, c;for (int i = 0; i < m; i++) {scanf("%d%d%d", &a, &b, &c);e[a][b] = c;e[b][a] = c;}dis[c1] = 0;w[c1] = weight[c1];num[c1] = 1;for (int i = 0; i < n; i++) {int u = -1, min = inf;for (int j = 0; j < n; j++) {if (vis[j] == false && dis[j] < min) {u = j;min = dis[j];}}if (u == -1) break;vis[u] = true;for (int v = 0; v < n; v++) {if (vis[v] == false && e[u][v] != inf) {if (dis[u] + e[u][v] < dis[v]) {dis[v] = dis[u] + e[u][v];num[v] = num[u];w[v] = w[u] + weight[v];}else if (dis[u] + e[u][v] == dis[v]) {num[v] = num[v] + num[u];if (w[u] + weight[v] > w[v])w[v] = w[u] + weight[v];}}}}printf("%d %d", num[c2], w[c2]);return 0;}
- Pat甲级1003. Emergency (25)
- 【PAT甲级】1003. Emergency (25)
- PAT甲级1003. Emergency (25)
- 1003. Emergency (25) PAT 甲级
- PAT甲级 1003. Emergency (25)
- PAT甲级1003. Emergency (25)
- PAT 甲级 1003. Emergency (25)
- PAT 甲级 1003.Emergency
- [PAT-甲级]1003.Emergency
- PAT 甲级 1003. Emergency
- 【PAT甲级】【C++】1003. Emergency (25)
- PAT TEST甲级1003. Emergency (25)
- PAT甲级练习1003. Emergency (25)
- PAT 甲级1003. Emergency (25) DIJKSTRA
- 1003. Emergency (25)-PAT甲级真题(Dijkstra算法)
- PAT甲级 1003.Emergency(25) 题目翻译与答案
- pat 甲级 1003 Emergency
- pat甲级_路径问题(例题:pat 1003 Emergency (25))
- 经典重读 | 深度学习方法:卷积神经网络结构变化——Spatial Transformer Networks
- KNN (K最近邻接算法)python 语言下的简单实现
- 数据库的增删改查
- pyqt5学习文档
- 无限轮播
- PAT 甲级 1003. Emergency (25)
- 最大元,归并排序作业
- 2017年进口食品代理加盟排行榜
- 负载均衡SLB百问FAQ
- Swift/OC
- Oracle 总结
- CentOS 7 中使用NTP进行时间同步
- memach类型转换异常java.lang.ClassCastException: java.lang.Byte cannot be cast to com.organization.model.
- SQL Server 2008中的代码安全(八) 透明数据加密(TDE)