Til the Cows Come Home
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 49420 Accepted: 16781
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.
OutputLine 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.
Source
USACO 2004 November
题意:求最短路径,给T条路径长短以及N个节点
题解:完完全全套用Dijkstra,注意输入会有同一条边但是长短不同的情况,判断一下就好
#include <iostream>
#include <cstdio>
#define maxNum 1<<29
#define maxRan 1005
using namespace std;
int Map[maxRan][maxRan];
int T,N;
void Dijkstra(){
//标记是否已经找到最短路径
int i,j;
bool isFond[maxRan];
//记录到每个点的最短距离
int minLen[maxRan];
for(i=1;i<=N;i++){
//默认没有找到
isFond[i]=0;
minLen[i]=Map[1][i];
}
for(i=1;i<=N;i++){
int minT=maxNum;
int minN=0;
for(j=1;j<=N;j++){
//找出当前路径最短的点
if(!isFond[j]&&minT>minLen[j]){
minN=j;
minT=minLen[j];
}
}
//找到到当前路径最短的点能到达的路径最短的点并更新
for(j=1;j<=N;j++){
if(!isFond[j]&&minLen[j]>Map[minN][j]+minT){
minLen[j]=Map[minN][j]+minT;
}
}
isFond[minN]=1;
}
printf("%d\n",minLen[N]);
}
int main()
{
while(~scanf("%d%d",&T,&N)){
//初始化地图,所有路径默认最大值
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++){
Map[j][i]=Map[i][j]= maxNum;
}
}
int a,b,len;
for(int i=0;i<T;i++){
scanf("%d%d%d",&a,&b,&len);
if(Map[a][b]>len)
{
Map[a][b]=len;
Map[b][a]=len;
}
}
//初始化完成,开始寻找
Dijkstra();
}
return 0;
}