时间限制: 2s
内存限制: 192MB 提交: 111 解决: 23
题目描述
给定M条边， N个点的带权无向图。求1到N的最短路。
输入格式
第一行：N,M(N<=100000，M<=500000)；
接下来M行3个正整数：ai,bi,ci表示ai,bi之间有一条长度为ci的路，ci<=1000。
样例输入
4 4
1 2 1
2 3 1
3 4 1
2 4 1
提示
【样例解释】
注意图中可能有重边和自环,数据保证1到N有路径相连。
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX