PAT 1003 Emergency python解法

最新推荐文章于 2024-08-06 14:35:14 发布

D_ry

最新推荐文章于 2024-08-06 14:35:14 发布

阅读量581

点赞数

分类专栏： python 用Python刷PAT (Advanced Level) Practice

本文链接：https://blog.csdn.net/qq_36936510/article/details/85267300

版权

该博客介绍了如何解决一个城市应急救援团队面对的问题，即从当前所在城市出发，通过特殊地图上的道路网络，寻找到达指定城市的最短路径，并在途中集结尽可能多的救援队伍。博客提供了输入规格，包括城市数量、道路数量、起始城市和目标城市，以及每个城市的救援队伍数量和各条道路的长度。样例输入和输出展示了如何找到两种不同最短路径并计算最大可能集结的救援队伍数量。

摘要由CSDN通过智能技术生成

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 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

inf = float('inf')
cities_num, roads_num, city_start, city_end =

最低0.47元/天解锁文章