#BZOJ4289. PA2012 Tax
-
ID: 2887
Type: RemoteJudge
1000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: (None)
Uploaded By:
root
PA2012 Tax
No submission language available for this problem.
题目描述
给出一个N个点M条边的无向图，经过一个点的代价是进入和离开这个点的两条边的边权的较大值，求从起点1到点N的最小代价。起点的代价是离开起点的边的边权，终点的代价是进入终点的边的边权
N<=100000
M<=200000
输入格式
输出格式
4 5
1 2 5
1 3 2
2 3 1
2 4 4
3 4 8
12