PAT A 1018（甲级）

最新推荐文章于 2021-01-26 22:00:36 发布

CrazyOnes

最新推荐文章于 2021-01-26 22:00:36 发布

阅读量2.1k

点赞数

分类专栏： PAT练习题文章标签： PAT PAT甲级 DFS Dijkstra 图的遍历

本文链接：https://blog.csdn.net/CrazyOnes/article/details/82502032

版权

该博客介绍了PAT甲级考试中的1018题，涉及公共自行车管理系统中如何调整站点状态至完美，并通过Dijkstra算法寻找从调度中心到指定站点的最短路径。当路径不唯一时，优先选择需要移动最少自行车的路径。文章提供了问题描述、输入输出规范及AC代码示例。

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

1018 Public Bike Management（30 分）

作者: CHEN, Yue

单位: 浙江大学

时间限制: 400 ms

内存限制: 64 MB

代码长度限制: 16 KB

There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and return it to any other stations in the city.

The Public Bike Management Center (PBMC) keeps monitoring the real-time capacity of all the stations. A station is said to be in perfect condition if it is exactly half-full. If a station is full or empty, PBMC will collect or send bikes to adjust the condition of that station to perfect. And more, all the stations on the way will be adjusted as well.

When a problem station is reported, PBMC will always choose the shortest path to reach that station. If there are more than one shortest path, the one that requires the least number of bikes sent from PBMC will be chosen.

The above figure illustrates an example. The stations are represented by vertices and the roads correspond to the edges. The number on an edge is the time taken to reach one end station from another. The number written inside a vertex S is the current number of bikes stored at S. Given that the maximum capacity of each station is 10. To solve the problem at S