HDU2680-Choose the best route
来源:互联网 发布:淘宝c店能报名双十一吗 编辑:程序博客网 时间:2024/04/29 19:29
Choose the best route
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13263 Accepted Submission(s): 4286
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
Author
dandelion
Source
2009浙江大学计算机研考复试(机试部分)——全真模拟
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <cmath>#include <queue>#include <stack>#include <vector>using namespace std;#define ll long longint n,m,s[1005],k,e;int visit[1005];int map[1005][1005];int dis[1005];const int INF=0x3f3f3f3f;struct node{ int id; int val; friend bool operator <(node a,node b) { return a.val>b.val; }}pre,nt;void dijkstra(int s){ memset(visit,0,sizeof visit); memset(dis,INF,sizeof dis); dis[s]=0; priority_queue<node>q; pre.id=s; pre.val=0; q.push(pre); while(!q.empty()) { pre=q.top(); q.pop(); int id=pre.id,val=pre.val; visit[id]=1; for(int i=1;i<=n;i++) { if(!visit[i]&&dis[i]>map[id][i]+val) { dis[i]=map[id][i]+val; nt.id=i; nt.val=val+map[id][i]; q.push(nt); } } }}int main(){ while(~scanf("%d %d %d",&n,&m,&e)) { memset(visit,0,sizeof visit); for(int i=0;i<=n;i++) { for(int j=0;j<=n;j++) { if(i==j) map[i][j]=0; else map[i][j]=INF; } } int a,b,c; for(int i=1;i<=m;i++) { scanf("%d %d %d",&a,&b,&c); if(map[b][a]>c) map[b][a]=c; } scanf("%d",&k); for(int i=1;i<=k;i++) scanf("%d",&s[i]); dijkstra(e); int mi=INF; for(int i=1;i<=k;i++) { if(dis[s[i]]<mi) mi=dis[s[i]]; } if(mi==INF) printf("-1\n"); else printf("%d\n",mi); } return 0;}
0 0
- 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
- hdu2680 Choose the best route (dijkstra)
- hdu2680最短路Choose the best route
- HDu2680(Choose the best route)
- Choose the best route hdu2680 Dijkstra
- hdu2680 Choose the best route (Dijkstra)
- HDU2680:Choose the best route(Dijkstra)
- HDU2680:Choose the best route(Dijkstra)
- HDU2680 Choose the best route 【Dijkstra】
- HDU2680 Choose the best route 单源最短路径
- HDU2680 Choose the best route 最短路
- HDU2680---Choose the best route(dijkstra&&SPFA)
- hdu2680 Choose the best route (dijkstra)
- HDU2680 Choose the best route 解题报告--Dijkstra
- iOS中(相册)摄像头获取的图片上传至服务器被自动旋转了
- JZOJ4769. graph
- 398. Random Pick Index
- 认识jQuery 在笔记中手打 可能单词有错
- 【USACO题库】3.2.2 Stringsobits__01串
- HDU2680-Choose the best route
- MapReduce算法形式七:多个mapreduce任务
- Android Support Design库之SnackBar初使用
- make menuconfig过程讲解
- Android系统相册换头像——最短的代码
- TCP-IP详解:SACK选项(Selective Acknowledgment)
- PopupWindow的初步使用
- 【备份专题】备份软件体系架构解析
- Android编译系统分析五:system.img的生成过程