HDOJ2680 Choose the best route
来源:互联网 发布:巅峰软件大全手机 编辑:程序博客网 时间:2024/06/06 12:27
Choose the best route
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7725 Accepted Submission(s): 2562
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>#include<cstdlib>#include<cstring>#define inf 0x3f3f3f3fusing namespace std;int map[1010][1010],d,s,n,w,m,dist[1010],vis[1010];int getnext(){ int i,u=-1,t=inf; for(i=1;i<=n;++i){ if(!vis[i]&&t>dist[i]){ t=dist[i];u=i; } } return u;}int dijkstra(){ int i,j,t; for(i=1;i<=n;++i){ vis[i]=0;dist[i]=inf; } int u=0;dist[0]=0; while(u!=-1){ for(i=0;i<=n;++i){ t=dist[u]+map[u][i]; if(dist[i]>t)dist[i]=t; } vis[u]=1; if(vis[s])return dist[s]; u=getnext(); } return -1;}int main(){ int i,j,q,p; while(scanf("%d%d%d",&n,&m,&s)==3){ memset(map,0x3f,sizeof(map)); for(i=0;i<m;++i){ scanf("%d%d%d",&q,&p,&d); if(map[q][p]>d)map[q][p]=d; } scanf("%d",&w); for(i=1;i<=w;++i){ scanf("%d",&j); map[0][j]=0; } dist[s]=inf; printf("%d\n",dijkstra()); } return 0;}
0 0
- HDOJ2680 Choose the best route
- hdoj2680 Choose the best route
- hdoj2680 Choose the best route(dijstra)
- Choose the best route
- Choose the best route
- Choose the best route
- Choose the best route
- Choose the best route
- Choose the best route
- HDOJ Choose the best route
- HDU2680 Choose the best route
- hdu2680 Choose the best route
- HDU2680-Choose the best route
- HDU2680 Choose the best route
- hdu2680 choose the best route
- HDU 2680 Choose the best route
- hdu2680 Choose the best route (dijkstra)
- HDU-2680 choose the best route
- Oracle BPM开发中遇到的一些问题和解决方法
- Hibernate关系映射
- Oracle中Hint深入理解
- Video Tracking Theory and Practice 关键翻译1
- Pat(Advanced Level)Practice--1086(Tree Traversals Again)
- HDOJ2680 Choose the best route
- 东京大学情报理工学系研究科招生海报
- 股票买入卖出手续费
- [数学][第二阶段-简单数学题][HDOJ-2033]人见人爱A+B
- 资源分享
- 《汇编语言》(王爽著)第14章_端口_习题解答
- Eclipse快捷键大全
- Java Linklist 类测试
- [leetcode]127 Word Ladder BFS