Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu
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.
参考模板:https://blog.csdn.net/acmer_sly/article/details/53314125
import java.util.*;
public class Main {
static int map[][];
static int book[];
static int dis[];
public static void main(String[] args) {
// write your code here
Scanner in=new Scanner(System.in);
int t=in.nextInt();
int n=in.nextInt();
int inf=999999999;
map=new int[n+1][n+1];
book=new int[n+1];
dis=new int[n+1];
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(i==j) map[i][j]=0;
else map[i][j]=inf;
for(int i=1;i<=t;i++)
{
int x=in.nextInt();
int y=in.nextInt();
int c=in.nextInt();
if(c<map[x][y])//原题有输入重边问题,神坑
map[y][x]=map[x][y]=c;
}
//初始化dis数组,这里是1号顶点到其余各个顶点的初始路程
for(int i=1;i<=n;i++)
dis[i]=map[1][i];
//book数组初始化
for(int i=1;i<=n;i++)
book[i]=0;
book[1]=1;
//Dijkstra算法核心语句
for(int i=1;i<=n-1;i++)
{
//找到离1号顶点最近的顶点
int min=inf;
int u=0;
for(int j=1;j<=n;j++)
{
if(book[j]==0 && dis[j]<min)
{
min=dis[j];
u=j;
}
}
book[u]=1;
for(int v=1;v<=n;v++)
{
if(map[u][v]<inf)
{
if(dis[v]>dis[u]+map[u][v])
dis[v]=dis[u]+map[u][v];
}
}
}
System.out.println(dis[n]);
}
}