Code Submission Evaluation System Login

CSES Problem Set


Task | Statistics

CSES - InvestigationCSES - Investigation

Time limit:1.00 s Memory limit:512 MB

You are going to travel from Syrjälä to Lehmälä by plane. You would like to find answers to the following questions:

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,\ldots,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ä.


Print four integers according to the problem statement.


4 5
1 4 5
1 2 4
2 4 5
1 3 2
3 4 3

5 2 1 2