作为城市应急救援队队长，你需要根据地图上的城市和道路快速响应紧急呼叫。地图上标注了各城市的救援队伍数量和道路长度。输入包含城市数量、道路数、起点和终点，以及每个城市的救援队伍数量和每条道路的长度。任务是找出从起点到终点的所有最短路径，并计算途中能召集的最大救援力量。输出是最短路径的数量和最大可集结的救援队伍数。
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
最低0.47元/天 解锁文章
170
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
