洛谷CF20C

题目描述

You are given a weighted undirected graph. The vertices are enumerated from 1 to nn . Your task is to find the shortest path between the vertex 11 and the vertex nn .

输入格式

The first line contains two integers nn and mm ( 2<=n<=10^{5},0<=m<=10^{5}2<=n<=105,0<=m<=105 ), where nn is the number of vertices and mm is the number of edges. Following mm lines contain one edge each in form a_{i}ai​ , b_{i}bi​ and w_{i}wi​ ( 1<=a_{i},b_{i}<=n,1<=w_{i}<=10^{6}1<=ai​,bi​<=n,1<=wi​<=106 ), where a_{i},b_{i}ai​,bi​ are edge endpoints and w_{i}wi​ is the length of the edge.

It is possible that the graph has loops and multiple edges between pair of vertices.

输出格式

Write the only integer -1 in case of no path. Write the shortest path in opposite case. If there are many solutions, print any of them.

题意翻译

题目大意

<