PAT 1003 Emergency（25）Python

最新推荐文章于 2024-09-12 07:00:00 发布

codeLeaves

最新推荐文章于 2024-09-12 07:00:00 发布

阅读量822

点赞数

分类专栏： PAT 文章标签： python PAT

本文链接：https://blog.csdn.net/laughing2333/article/details/75204963

版权

题目描述

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

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 <