Til the Cows Come Home
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 58622 | Accepted: 19978 |
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 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:
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.
题意:求起点到终点n的最短路径。
思路:Dijkstra算法
Dijkstra:Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法,计算一个节点到其他节点的最短路径。
主要特点:以起点为中心向外层层扩散,直到扩展到中点为止。
要求该算法要求图中不存在负权边。
#include<cstdio>
#include<cstring>
#define INF 99999999
using namespace std;
int map[1005][1005];
int dis[1005];//储存起点到任意一点i的最小距离
void dijkstra(int n)
{
for(int i=1;i<=n;i++)
dis[i]=map[1][i];
int visit[1005];
memset(visit,0,sizeof(visit));
int min,k;
visit[1]=1;
for(int i=1;i<n;i++)
{
min=INF;
k=1;
for(int j=1;j<=n;j++)
{
if(visit[j]==0&&min>dis[j])
{
min=dis[j];
k=j;
}
}
visit[k]=1;
for(int j=1;j<=n;j++)
{
if(dis[j]>dis[k]+map[k][j])
dis[j]=dis[k]+map[k][j];
}
}
printf("%d\n",dis[n]);
}
int main()
{
int t,n;
while(scanf("%d %d",&t,&n)!=EOF)
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(i==j)
map[i][i]=0;
else
map[i][j]=map[j][i]=INF;
}
}
int a,b,c;
for(int i=1;i<=t;i++)
{
scanf("%d %d %d",&a,&b,&c);
if(c<map[a][b])//可能多条路,只保留最短的
map[a][b]=map[b][a]=c;
}
dijkstra(n);
}
return 0;
}