Time Limit: 1000MS | Memory Limit: 65536K |
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:
Bessie can get home by following trails 4, 3, 2, and 1.
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.
Source
刷水好快乐!
题目就是一道最短路。编下dij就水过了。。。
不过有重边(取小的边)。还有先输入边数再输入点数。
AC CODE
program pku_2387;
var d:array[1..1000,1..1000] of longint;
dist:array[1..1000] of longint;
p:array[1..1000] of boolean;
n,m,i,j,x,y,z,now,int,min:longint;
begin
readln(m,n);
for i:=1 to m do
begin
readln(x,y,z);
if (d[x,y]=0) or (d[x,y]>z) then
begin
d[x,y]:=z; d[y,x]:=z;
end;
end;
for i:=1 to n do dist[i]:=maxlongint;
dist[1]:=0; now:=1; p[1]:=true;
for i:=1 to n do
begin
min:=maxlongint; int:=0;
for j:=1 to n do
if not(p[j]) then
begin
if (d[now,j]>0) and (dist[now]+d[now,j]<dist[j]) then
dist[j]:=dist[now]+d[now,j];
if dist[j]<min then
begin
min:=dist[j]; int:=j;
end;
end;
if (int=n) or (int=0) then break;
p[int]:=true; now:=int;
end;
if dist[n]<>maxlongint then writeln(dist[n]) else writeln('-1');
end.
var d:array[1..1000,1..1000] of longint;
begin
end.