영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You want to travel from Syrjälä to Lehmälä by plane using a minimum-price route. Which cities will you certainly visit?
Input
The first input line contains two integers n and m: the number of cities and the number of flights. The cities are numbered 1,2,…,n. City 1 is Syrjälä, and city n is Lehmälä.
After this, there are m lines describing the flights. Each line has three integers a, b, and c: there is a flight from city a to city b with price c. All flights are one-way flights.
You may assume that there is a route from Syrjälä to Lehmälä.
Output
First print an integer k: the number of cities that are certainly in the route. After this, print the k cities sorted in increasing order.
Constraints
- 1 ≤ n ≤ 10^5
- 1 ≤ m ≤ 2 · 10^5
- 1 ≤ a,b ≤ n
- 1 ≤ c ≤ 10^9
예제
예제 1
5 6 1 2 3 1 3 4 2 3 1 2 4 5 3 4 1 4 5 8
4 1 3 4 5