Emergency (dijkstra 变形）

最新推荐文章于 2020-11-06 23:06:28 发布

Hanylch

最新推荐文章于 2020-11-06 23:06:28 发布

阅读量4.2k

点赞数

本文链接：https://blog.csdn.net/zhuanshunzhe/article/details/64921255

版权

作为城市紧急救援队队长，你需要根据特殊地图快速规划从所在城市到目标城市的最短路线，并沿途召集最多救援队伍。输入包含城市数量、道路数、起点和终点，以及各城市救援队伍数量和道路长度。输出是最短路径数量和能召集的最大救援队伍数。给定示例中，从城市0到城市2有2条不同最短路径，最大可召集4支救援队伍。

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

Emergency
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