Google 10月份在线笔试ProblemB(个人代码，未必最优，请不吝赐教)

最新推荐文章于 2018-11-08 09:21:08 发布

knight3396

最新推荐文章于 2018-11-08 09:21:08 发布

阅读量560

点赞数

分类专栏： Google笔试文章标签： APAC Google

本文链接：https://blog.csdn.net/knight3396/article/details/40452785

版权

本文介绍了一个Google在线笔试题目，涉及城市地铁系统的时间优化问题。内容包括地铁线路、站点、等待时间和转乘隧道的描述，以及如何计算从一个站点到另一个站点的最短时间。解题思路是利用有向带权图的最短路径算法解决。

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

Problem

Tom is taking metros in the city to go from station to station.

The metro system in the city works like this:

There are N metro lines in the city: line 1, line 2, ..., line N.
For each metro i, there are SN_i stations. Let's assume they are S_i,1,S_i,2, ... , S_{i,SN_i}. These stations are ordered from one end point to the other end point. The metro is running in both directions. In other words, the metro is going from S_i,1 -> S_i,2 -> ... -> S_{i,SN_i}, and S_{i,SN_i} -> S_{i,SN_i-1} -> ... -> S_i,1. You can take the metro from any station and get off at any station. It takes a certain time to travel from one station to the next station. It takes Time_i,1 minutes to travel from S_i,1 to S_i,2, Time_i,2 minutes to travel from S_i,2 to S_i,3, etc. It takes the same time in the other direction.
There are M transfer tunnels. Each transfer tunnel connects two stations of different metro lines. It takes a certain amount of time to travel through a tunnel in either direction. You can get off the metro at one end of the tunnel and walk through the tunnel to the station at the another end.
When you arrive at a metro station of line i, you need to wait W_i minutes for the next metro.

Now, you are going to travel from one station to another. Find out the shortest time you need.

Input

The first line of the input gives the number of test cases, T. T test cases follow.

Each test case starts with an integer N, the number of metro lines. N metros descriptions follow. Each metro description starts with two integers SN_i and W_i, the number of stations and th