文章标题 Til the Cows Come Home
来源:互联网 发布:淘宝订单交易风险违规 编辑:程序博客网 时间:2024/06/05 04:51
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.
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.
Output - Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.
-
Sample Input
5 5
1 2 20
2 3 30
3 4 20
4 5 20
Sample Output
90
dijkstra模板题
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#define inf 0x3f3f3fusing namespace std;int map[1009][1009],book[1009],dis[1009];int main(){ int T,n; while(~scanf("%d%d",&T,&n)) { int i,j; for(i=1; i<=n; i++) for(j=1; j<=n; j++) if(i==j) map[i][j]=0; else map[i][j]=inf; int a,b,c; for(i=1; i<=T; i++) { scanf("%d%d%d",&a,&b,&c); map[a][b]=map[b][a]=min(c,map[a][b]); } for(i=1; i<=n; i++) dis[i]=map[1][i]; memset(book,0,sizeof(book)); int u; for(i=1; i<=n; i++) { int minn=inf; for(j=1; j<=n; j++) { if(!book[j]&&dis[j]<minn) { minn=dis[j]; u=j; } } book[u]=1; for(int v=1; v<=n; v++) { if(map[u][v]<inf) { dis[v]=min(dis[v],dis[u]+map[u][v]); } } } printf("%d\n",dis[n]); }}
- 文章标题 Til the Cows Come Home
- 文章标题 Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- Til the Cows Come Home
- POJ 2387 Til the Cows Come Home
- PKU2387 Til the Cows Come Home
- poj 2387 Til the Cows Come Home
- gitlab配置修改
- 初学安卓——权威指南挑第二版挑战练习
- 【开发工具】dll程序集合并工具之ILMerge
- 剑指offer13:在O(1)时间删除链表结点
- Numpy学习笔记之线性代数
- 文章标题 Til the Cows Come Home
- Til the Cows Come Home(POJ 2387)
- 线程同步的方法有哪些(面试题)
- java-泛型程序设计(一)
- ISE与MATLAB的联合使用
- 画图板的课后感想
- 机器学习定义
- vs2013下的python远程调试支持
- getElementsByClassName这个坑