POJ-2387 Til the Cows Come Home

来源:互联网 发布:贵州广电网络微博 编辑:程序博客网 时间:2024/05/19 02:02
Til the Cows Come Home
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 57202 Accepted: 19436

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

Source

USACO 2004 November

最短路径问题,可以用Dijkstra算法或者Bellman Ford算

Bellman Ford代码:

#include#include#include#includeusing namespace std;const int N = 1000 + 5;const int INF = (1<<29);struct node{    int s,e,c;    node(int s,int e,int c):s(s),e(e),c(c){}};int n,m,D[N];vector edge;int Bellman_Ford(){    for(int i=1;i<=n;i++) D[i] = INF;    D[n] = 0;    for(int k=1;k

原创粉丝点击