hdu-2680-Choose the best route(dijkstra)
来源:互联网 发布:搜索引擎优化案例 编辑:程序博客网 时间:2024/05/06 08:09
Choose the best route
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10470 Accepted Submission(s): 3367
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浙江大学计算机研考复试(机试部分)——全真模拟
Recommend
lcy | We have carefully selected several similar problems for you: 2112 2544 1217 1142 1385
题目分析:
也是走模板但是要注意了,这个是单向图,好好看看单向图是怎么建表的
#include<cstdio>#include<cstring>#include<algorithm>#define INF 0x3f3f3f3f#define M 1010using namespace std;int mark[M],dis[M],time[M][M];int n,m,s;void dijkstra(int s){memset(mark,0,sizeof(mark));memset(dis,INF,sizeof(dis));dis[s]=0;while(1){int v=-1;for(int i=1;i<=n;i++) if(!mark[i]&&(v==-1||dis[i]<dis[v])) v=i;if(v==-1) break;mark[v]=1;for(int i=1;i<=n;i++) dis[i]=min(dis[i],dis[v]+time[v][i]);}}int main(){while(~scanf("%d%d%d",&n,&m,&s)){memset(time,INF,sizeof(time));while(m--){int a,b,c;scanf("%d%d%d",&a,&b,&c);if(time[b][a]>c&&a!=b)time[b][a]=c;// 对就这里 单向建就行了,我这里是从终点查起点了所以反向建了}int w,st[M];scanf("%d",&w);for(int i=1;i<=w;i++)scanf("%d",&st[i]);int minn=INF;dijkstra(s);// 因为就一个终点但是起点不是一个,所以反向查比较省时间for(int i=1;i<=w;i++) minn=min(minn,dis[st[i]]); if(minn==INF) printf("-1\n"); else printf("%d\n",minn);}return 0;}
0 0
- HDU 2680 Choose the best route(dijkstra)
- HDU--2680Choose 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)
- hdu 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)
- hdu 2680 Choose the best route(spfa/dijkstra)
- hdu 2680 Choose the best route(SPFA或者Dijkstra)
- 典型的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)
- hdu 2680 Choose the best route(最短路dijkstra(有重边))
- HDU 2680:Choose the best route【Dijkstra & SPFA】
- hdu-2680Choose the best route (dijkstra求最短路)
- R语言_基本数据管理
- boost 1.56.0 编译及使用
- 最简单,最能看得懂的ViewPager
- 用 consul + consul-template + registrator + nginx 打造真正可动态扩展的服务架构
- html input text 得到焦点后自动全选
- hdu-2680-Choose the best route(dijkstra)
- 如何在Ubuntu手机应用中得到所有的环境变量值
- soap webservice和resetful api
- 数据结构——全面学习哈希
- ViewPager + Fragment套用Fragment的问题
- 趁着没发霉重写库函数之strstr
- Java 之 商品条形码的验证
- OpenWrt下TL-WN722N无线网卡驱动安装
- dwr 配置文件 之web.xml