poj 2387-Til the Cows Come Home-dijkstra
来源:互联网 发布:知乎 电影书籍推荐 编辑:程序博客网 时间:2024/05/18 17:58
Til the Cows Come Home
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22411 Accepted: 7506
Description
Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible.
Farmer John's field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in which Bessie stands all day is landmark N. Cows travel in the field using T (1 <= T <= 2000) bidirectional cow-trails of various lengths between the landmarks. Bessie is not confident of her navigation ability, so she always stays on a trail from its start to its end once she starts it.
Given the trails between the landmarks, determine the minimum distance Bessie must walk to get back to the barn. It is guaranteed that some such route exists.
Farmer John's field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in which Bessie stands all day is landmark N. Cows travel in the field using T (1 <= T <= 2000) bidirectional cow-trails of various lengths between the landmarks. Bessie is not confident of her navigation ability, so she always stays on a trail from its start to its end once she starts it.
Given the trails between the landmarks, determine the minimum distance Bessie must walk to get back to the barn. It is guaranteed that some such route exists.
Input
* Line 1: Two integers: T and N
* Lines 2..T+1: Each line describes a trail as three space-separated integers. The first two integers are the landmarks between which the trail travels. The third integer is the length of the trail, range 1..100.
* Lines 2..T+1: Each line describes a trail as three space-separated integers. The first two integers are the landmarks between which the trail travels. The third integer is the length of the trail, range 1..100.
Output
* Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.
Sample Input
5 51 2 202 3 303 4 204 5 201 5 100
Sample Output
90
Hint
INPUT DETAILS:
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.
//好吧。其实是个水题,题目描述的很简单,代码也是水水的飘过~
从1到n的最短距离、调用dijkstra(1),然后输出dis[n].
代码:
#include<cstdio>#include<string>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>using namespace std;#define INF 10000001int map[1001][1001]; int dis[1001]; bool vis[1001]; int n,m; void dijkstra(int s){ int k; for(int i=1;i<=n;i++) dis[i]=map[s][i],vis[i]=false; vis[s]=true; dis[s]=0; for(int i=1;i<=n;i++){ int MIN=INF; for(int j=1;j<=n;j++) if((!vis[j])&&(dis[j]<MIN)){ k=j; MIN=dis[j]; } vis[k]=true; for(int j=1;j<=n;j++) if((!vis[j])&&(dis[k]+map[k][j]<dis[j])) dis[j]=dis[k]+map[k][j]; } } void init(){for(int i=1;i<=n;i++)for(int j=1;j<=n;j++){if(i==j) map[i][j]=0;else map[i][j]=INF;}}int main(){ int a,b,c; scanf("%d%d",&m,&n); init(); for(int i=0;i<m;i++){scanf("%d%d%d",&a,&b,&c); map[a][b]=map[b][a]=min(map[a][b],c);} dijkstra(1); printf("%d\n",dis[n]); return 0; }
- poj 2387-Til the Cows Come Home-dijkstra
- POJ 2387 Til the Cows Come Home 最短路-Dijkstra
- POJ 2387 Til the Cows Come Home (Dijkstra)
- POJ 2387 Til the Cows Come Home(Dijkstra简单题)
- Til the Cows Come Home - POJ 2387 Dijkstra
- POJ 2387 Til the Cows Come Home(Dijkstra判重边)
- POJ 2387 || Til the Cows Come Home(最短路,dijkstra
- POJ 2387 Til the Cows Come Home (dijkstra)
- Dijkstra-POJ-2387-Til the Cows Come Home
- poj 2387 Til the Cows Come Home(dijkstra算法)
- 2387 poj Til the Cows Come Home【dijkstra,经典&&基础】
- POJ 2387 Til the Cows Come Home(Dijkstra)
- poj 2387 Til the Cows Come Home(dijkstra)
- poj 2387 Til the Cows Come Home(Dijkstra)
- poj 2387 Til the Cows Come Home dijkstra
- POJ - 2387 Til the Cows Come Home(Dijkstra)
- poj 2387 Til the Cows Come Home dijkstra
- POJ 2387 Til the Cows Come Home (Dijkstra)
- Myeclipse中修改JSP模板
- AJAX在ASP.NET中的应用(二)——Jquery封装的AJAX
- windows7---库
- 如何成为一名python高手
- Java中keytool的使用总结
- poj 2387-Til the Cows Come Home-dijkstra
- Sleepless in Test---测试小兵关于软件测试的一些思考
- 虚拟项目学习git/github原理与基本操作2
- 晶晶实验二_插入时对L1块的选择篇
- TTCN-3 编码解码相关模块引入2
- 算法之排列和组合算法
- Revit 之开篇
- N皇后
- 好看的分页样式