2680 Choose the best route【dijkstra】
来源:互联网 发布:java web哪本书 编辑:程序博客网 时间:2024/06/03 20:40
Choose the best route
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10569 Accepted Submission(s): 3400
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<stdio.h>#include<string.h>#define inf 0x3f3f3f3f#define min(a,b) (a<b?a:b)int map[1005][1005],v[1005],dis[1005],n,m;int bg[1005],str;void dijkstra(int s){ memset(dis,inf,sizeof(dis)); memset(v,0,sizeof(v)); dis[s]=0;//v[s]=1; for(int i=1;i<=n;++i) { int x,temp=inf; for(int j=1;j<=n;++j) { if(!v[j]&&dis[j]<temp) { temp=dis[x=j];}}v[x]=1;for(int j=1;j<=n;++j){dis[j]=min(dis[j],dis[x]+map[x][j]);}} int minn=inf;for(int i=0;i<m;++i)//找最小{int x=dis[bg[i]];if(x<minn){minn=x;}}if(minn==inf)//如果找不到最小....{printf("-1\n");return;}printf("%d\n",minn);}int main(){ int i; while(~scanf("%d%d%d",&n,&m,&str)) { memset(map,inf,sizeof(map)); for(i=0;i<m;++i) { int a,b,c; scanf("%d%d%d",&a,&b,&c); map[b][a]=min(map[b][a],c);//反向建图.... } scanf("%d",&m); for(i=0;i<m;++i) { scanf("%d",bg+i);} dijkstra(str); } return 0;}
0 0
- HDU 2680 Choose the best route(dijkstra)
- HDU--2680Choose the best route【Dijkstra】
- HDOJ-2680Choose the best route(Dijkstra)
- hdu 2680 Choose the best route (dijkstra)
- 2680 Choose the best route【dijkstra】
- hdoj 2680 Choose the best route 【dijkstra】
- HDU 2680 Choose the best route dijkstra
- HDU 2680-Choose the best route(Dijkstra)
- 【最短路+dijkstra】 2680 Choose the best route
- 典型的dijkstra HDU 2680 Choose the best route
- hdu 2680-Choose the best route最短路dijkstra
- HDU 2680 Choose the best route 变形最短路 DIJKSTRA
- HDU 2680 Choose the best route(简单Dijkstra)
- HDOJ 2680 Choose the best route(最短路,dijkstra)
- hdu 2680 Choose the best route (Dijkstra & 反向图)
- hdu 2680 Choose the best route(最短路dijkstra(有重边))
- HDU-2680 Choose the best route(最短路[Dijkstra])
- Choose the best route 2680 (dijkstra,反向建图)
- oracle数据库使用mybatis批量插入
- 使用YUI Compressor压缩JS和Css,批处理,右键,注册表,打包
- PowerBuilder中使用JDBC连接MYSQL 无法使用COUNT(*) MAX() 函数的处理
- maven中进行junit测试报class not found的问题
- Leetcode#73||Set Matrix Zeroes
- 2680 Choose the best route【dijkstra】
- eclipse中的.project 和 .classpath文件的具体作用
- Java获取用户IP地址
- 我们的浏览器究竟是如何工作的
- Android学习心得(14) --- Android代码混淆(2)
- 由于php高版本不能使用$嵌夽,所以可以使用判断的方式
- java-String常用方法
- poj 3468 线段树成段增减+区间求和
- ionic页面缓存和局部刷新