作为城市应急救援队队长，你需要解决一个紧急救援问题，地图上标记了城市、道路长度和可用救援队伍。输入包含城市数量、道路数及起始和目标城市。每个城市有救援队伍数量，每条道路连接两个城市并有长度。任务是找到从起点到目标的最短路径并最大化途中召集的救援队伍。Floyd算法被用于求解，但遇到了未通过测试的情况。
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
订阅专栏 解锁全文
扫一扫
1万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
