两种方法。dijkstra+最短路径条数+点权值，二维数组的fill：fill(g[0], g[0] + maxn * maxn, INF)；A1003 Emergency (25分)

最新推荐文章于 2022-05-13 11:38:51 发布

ur_ytii

最新推荐文章于 2022-05-13 11:38:51 发布

阅读量172

点赞数

分类专栏：算法技巧

本文链接：https://blog.csdn.net/ur_ytii/article/details/113194079

版权

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.