Choose the best route(http://acm.hdu.edu.cn/showproblem.php?pid=2680)
来源:互联网 发布:网络p2p报警 编辑:程序博客网 时间:2024/05/12 11:05
Choose the best route
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10551 Accepted Submission(s): 3395
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.
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 51 2 21 5 31 3 42 4 72 5 62 3 53 5 14 5 122 34 3 41 2 31 3 42 3 211
Sample Output
1-1#include<cstdio>#define max 0x3f3f3f3f#define min(a,b) (a>b?b:a)int n,dis[1005],cost[1005][1005];int vis[1005];void dijkstra(int a){ int i; for(i=1;i<=n;i++) { dis[i]=max; vis[i]=0; } dis[a]=0; while(1) { int v=-1; for(i=1;i<=n;i++) if(!vis[i]&&(dis[i]<dis[v]||v==-1)) v=i; if(v==-1) break; vis[v]=1; for(i=1;i<=n;i++) dis[i]=min(dis[i],dis[v]+cost[v][i]); }}int main(){ int m,s,i,j,a,b,c; while(~scanf("%d%d%d",&n,&m,&s)) { int ans=max; for(i=1;i<=n;i++) for(j=1;j<=n;j++) cost[i][j]=max;//两车站间的距离初始为最大 while(m--) { scanf("%d%d%d",&a,&b,&c); cost[b][a]=min(cost[b][a],c);//有重边,取最小的 } scanf("%d",&a); dijkstra(s); for(i=0;i<a;i++) { scanf("%d",&b); ans=min(ans,dis[b]); } if(ans==max)//判断 printf("-1\n"); else printf("%d\n",ans); } return 0;}
0 0
- Choose the best route(http://acm.hdu.edu.cn/showproblem.php?pid=2680)
- http://acm.hdu.edu.cn/showproblem.php?pid=2680&&Choose the best route
- http://acm.hdu.edu.cn/showproblem.php?pid=1005
- http://acm.hdu.edu.cn/showproblem.php?pid=1333
- http://acm.hdu.edu.cn/showproblem.php?pid=2710
- http://acm.hdu.edu.cn/showproblem.php?pid=2866
- http://acm.hdu.edu.cn/showproblem.php?pid=1041
- http://acm.hdu.edu.cn/showproblem.php?pid=1719
- http://acm.hdu.edu.cn/showproblem.php?pid=2136
- http://acm.hdu.edu.cn/showproblem.php?pid=1166
- http://acm.hdu.edu.cn/showproblem.php?pid=3519
- http://acm.hdu.edu.cn/showproblem.php?pid=2446
- http://acm.hdu.edu.cn/showproblem.php?pid=1709
- http://acm.hdu.edu.cn/showproblem.php?pid=1874
- http://acm.hdu.edu.cn/showproblem.php?pid=1863
- http://acm.hdu.edu.cn/showproblem.php?pid=1879
- http://acm.hdu.edu.cn/showproblem.php?pid=1875
- http://acm.hdu.edu.cn/showproblem.php?pid=1102
- REST调用
- linux下,u盘只读问题
- 重构21-25
- java 观察者模式
- Linux系统性能优化 磁盘
- Choose the best route(http://acm.hdu.edu.cn/showproblem.php?pid=2680)
- 基于linux自动创建设备节点而引入的疑问
- Linux中oracle学习总结——解决backspace和上下键使用出现乱码
- 动态代理应用场景 Java
- js data日期初始化的方法
- fatal error C1853解决方法
- 需求 - 8 - UIView的“截屏”
- mysql查看某资源下的评论数量和收藏数量
- C++ tinyxml使用