Choose the best route |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
Total Submission(s): 144 Accepted Submission(s): 57 |
Problem Description
One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city’s traffic route, and the stations which are near Kiki’s home so that she can take. You may suppose Kiki can change the bus at any station. Please find out the least time Kiki needs to spend. To make it easy, if the city have n bus stations ,the stations will been expressed as an integer 1,2,3…n.
|
Input
There are several test cases.
Each case begins with three integers n, m and s,(n<1000,m<20000,1=<s<=n) n stands for the number of bus stations in this city and m stands for the number of directed ways between bus stations .(Maybe there are several ways between two bus stations .) s stands for the bus station that near Kiki’s friend’s home. Then follow m lines ,each line contains three integers p , q , t (0<t<=1000). means from station p to station q there is a way and it will costs t minutes . Then a line with an integer w(0<w<n), means the number of stations Kiki can take at the beginning. Then follows w integers stands for these stations. |
Output
The output contains one line for each data set : the least time Kiki needs to spend ,if it’s impossible to find such a route ,just output “-1”.
|
Sample Input
5 8 5 1 2 2 1 5 3 1 3 4 2 4 7 2 5 6 2 3 5 3 5 1 4 5 1 2 2 3 4 3 4 1 2 3 1 3 4 2 3 2 1 1 |
Sample Output
1 -1 |
Author
dandelion
|
Source
题目大意:
给出 n m E 代表 n 个城市,m条路,单向!! E 是终点
然后给出 路
最后给出 k 个可以选择的起点
思路:
正常最短路,不过我的最短路是单源最短路,用的优先队列,然后我发现大家没有一个人和我写的一样。。。好尴尬。
构建一个虚拟的 0 节点,代表起点,然后把可以选择的起点放入 0 的后继节点中,花费置为 0 这样就转化成了一个单源最短路的问题了。
我把 所有的点都 ++ 是怕出现 0 节点
AC代码:
|
HDU 2680 Choose the best route 最短路
最新推荐文章于 2016-11-11 17:34:06 发布