HDU - 2680 - Choose the best route (经典最短路问题dijkstra算法!!)
来源:互联网 发布:js调用android和ios 编辑:程序博客网 时间:2024/05/16 01:04
Choose the best route
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7671 Accepted Submission(s): 2524
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浙江大学计算机研考复试(机试部分)——全真模拟
AC代码:
#include <cstdio>#include <cstring>#include <algorithm>#define INF 0x7f7f7f7fusing namespace std;const int MAX = 1005;int n, m, s;int map[MAX][MAX], dis[MAX], vis[MAX];void dijk(int s){for(int i=1; i<=n; i++) dis[i] = map[s][i];vis[s] = 1; dis[s] = 0;for(int i=1; i<n; i++){int min = INF, pos;for(int j = 1; j <= n; j++)if(!vis[j] && dis[j] < min)min = dis[pos = j];if(min == INF) break;vis[pos] = 1;for(int j=1; j<=n; j++)if(!vis[j] && dis[pos] + map[pos][j] < dis[j])dis[j] = dis[pos] + map[pos][j];}}int main(){while(scanf("%d %d %d", &n, &m, &s) != EOF){memset(vis, 0, sizeof(vis));memset(map, 0x7f, sizeof(map));while(m--){int x, y, w;scanf("%d %d %d", &x, &y, &w);if(w < map[y][x]) map[y][x] = w;//注意是有向的,反方向 }dijk(s);int a, b, ans = INF;scanf("%d", &b);for(int i=1; i<=b; i++){scanf("%d", &a);ans = min(ans, dis[a]);}if(ans != INF)printf("%d\n", ans);else printf("-1\n");}return 0;}
1 0
- 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 2680-Choose the best route最短路dijkstra
- HDU 2680 Choose the best route 变形最短路 DIJKSTRA
- hdu 2680 Choose the best route(最短路dijkstra(有重边))
- hdu-2680Choose the best route (dijkstra求最短路)
- hdu Choose the best route(最短路 --- Dijkstra)
- hdu2680 Choose the best route 最短路(Dijkstra算法)
- HDU2680-Choose the best route(经典最短路问题dijkstra算法)
- HDOJ 2680 Choose the best route(最短路,dijkstra)
- HDOJ 2680 Choose the best route(最短路--dijkstra)
- HDU 2680Choose the best route(dijk最短路)
- HDU 2680Choose the best route (最短路+迪杰斯特拉)
- hdu 2680 Choose the best route(最短路)
- HDU 2680 Choose the best route(最短路,反向)
- 如何安装星际译王
- MFC中的消息映射(Message Mapping)
- Android关于ListView的优化问题
- struct内存对齐
- hadoop面试题
- HDU - 2680 - Choose the best route (经典最短路问题dijkstra算法!!)
- lua中的table函
- 利用Matlab的Simulink原理框图来画bode图的方法
- OpenCV滤波之copyMakeBorder和borderInterpolate
- 新年梦想
- Java基础----序列化问题
- 思科CCNA第一学期第五章答案
- 电商课题VII:支付交易一般性准则
- 不参加csdn五行代码大赛