POJ 2387 Til the Cows Come Home

题目连接:

http://poj.org/problem?id=2387

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.

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
1 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.

题意描述:

最短路水题。

解题思路:

处理数据,使用迪杰斯特拉算法。

AC代码:

 1 #include<stdio.h>
 2 #include<string.h>
 3 int e[1010][1010],dis[1010],bk[1010];
 4 int main()
 5 {
 6     int i,j,min,t,t1,t2,t3,n,u,v;
 7     int inf=99999999;
 8     while(scanf("%d%d",&t,&n)!=EOF)
 9     {
10         for(i=1;i<=n;i++)
11         {
12             for(j=1;j<=n;j++)
13             {
14                 if(i==j)
15                 e[i][j]=0;
16                 else
17                 e[i][j]=inf;
18             }
19         }
20         for(i=1;i<=t;i++)
21         {
22             scanf("%d%d%d",&t1,&t2,&t3);
23             if(e[t1][t2]>t3)
24             {
25                 e[t1][t2]=t3;
26                 e[t2][t1]=t3;
27             }
28         }
29         for(i=1;i<=n;i++)
30             dis[i]=e[1][i];
31         memset(bk,0,sizeof(bk));
32         bk[1]=1;
33         for(i=1;i<=n-1;i++)
34         {
35             min=inf;
36             for(j=1;j<=n;j++)
37             {
38                 if(bk[j]==0&&dis[j]<min)
39                 {
40                     min=dis[j];
41                     u=j;
42                 }
43             }
44             bk[u]=1;
45             for(v=1;v<=n;v++)
46             {
47                 if(e[u][v]<inf && dis[v]>dis[u]+e[u][v])
48                         dis[v]=dis[u]+e[u][v];
49             }
50         }
51         printf("%d\n",dis[n]);
52     }
53     return 0;
54 }
时间: 2024-10-02 01:39:48

POJ 2387 Til the Cows Come Home的相关文章

POJ 2387 Til the Cows Come Home (最短路+Dijkstra)

Til the Cows Come Home Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 29550   Accepted: 9935 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

POJ 2387 Til the Cows Come Home dijkstra算法 用邻接表和邻接矩阵

题目如下: Til the Cows Come Home Time Limit: 1000MS        Memory Limit: 65536K Total Submissions: 27726        Accepted: 9353 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 wa

poj 2387 Til the Cows Come Home(dijkstra算法)

题目链接:http://poj.org/problem?id=2387 题目大意:起点一定是1,终点给出,然后求出1到所给点的最短路径. 注意的是先输入边,在输入的顶点数,不要弄反哦~~~ 1 #include <iostream> 2 #include <cstdio> 3 using namespace std; 4 int map[2010][2010],Min,node[2010],vis[2010],t,q; 5 const int INF=9999999; 6 7 vo

[2016-04-02][POJ][2387][Til the Cows Come Home]

时间:2016-04-02 10:34:36 星期六 题目编号:[2016-04-02][POJ][2387][Til the Cows Come Home] 题目大意:给定n个节点和t条路,求n到1的最短路长度 分析:跑一次最短路即可 遇到的问题: 据说是多重边,如果是用邻接矩阵的就要更新最小值, 此题是先输入t,再输入n,输入的时候读错,无限WA- #include <queue> #include <cstring> #include <cstdio> using

POJ 2387 Til the Cows Come Home (Dijkstra)

题目链接:POJ 2387 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 possib

POJ 2387 Til the Cows Come Home(最短路 Dijkstra/spfa)

传送门 Til the Cows Come Home Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 46727   Accepted: 15899 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

POJ 2387 Til the Cows Come Home Dijkstra求最短路径

Til the Cows Come Home 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.

怒学三算法 POJ 2387 Til the Cows Come Home (Bellman_Ford || Dijkstra || SPFA)

Til the Cows Come Home Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 33015   Accepted: 11174 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

poj 2387 Til the Cows Come Home(最短路)

题目链接:http://poj.org/problem?id=2387 题目大意:求点1到点n的最短距离 1.Dijkstras算法 #include <iostream> #include <cstdio> #include <cstring> using namespace std; #define maxn 1010 #define INF 0x3f3f3f int map[maxn][maxn]; int vis[maxn]; //标记最短路的点 int dis