- 1新手云服务器上搭建个人网站+数据库（宝塔面板）_宝塔服务器搭建网站教程
- 2Elasticsearch中的笔试和面试---24道进阶必备Elasticsearch面试真题_es php 面试题
- 3《算法导论》学习笔记之Chapter12二叉树基本特点，及二叉搜索树（查找树）_考虑一个二值搜索树 ,它的键是不同的。表明,如果 中的一个节点 的右子树
- 4力扣62题：不同路径_力扣62题超出时间限制
- 5【安卓开发】发送广播报错One of RECEIVER_EXPORTED or RECEIVER_NOT_EXPORTED..._a receiver isn't being registered exclusively for
- 6深入理解内联函数（C语言）
- 76款令人相见恨晚的在线搜索网站，成年后都会要用上，了解一下！
- 8美国服务器如何避免网络漏洞?
- 9Apache Zookeeper未授权访问漏洞
- 10电子技术基础(三)_第6章组合逻辑电路_译码器_数据选择器_数据比较器_地址输入端和数据输入端区别
PAT (Advanced Level) 1003 Emergency（25 分）_pta advance level 1003
赞
踩
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
