HIGHWAYS - Highways

A number of cities are connected by a network of highways. Each highway is bidirectional and connects two cities, with a given travel time. What is the shortest time to get from a given city to another given city?


The first line of input contains the number of test cases.

Each test case starts with a line containing the number of cities n (2 ≤ n ≤ 100000), the number of highways m (1 ≤ m ≤ 100000), the starting city and the ending city. Cities are numbered from 1 to n.

Then m lines follow, each describing one highway. The description consists of the two distinct city numbers and the time in minutes to travel along the highway. The time will be between 1 and 1000.


For each test case output a single line containing the minimum time it takes to get from the start to the destination. If no connection exists, output NONE.


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


hide comments
Jakub ©afin: 2011-12-25 21:49:45

Essam: think about it - it's not worth it

multisystem: 2011-03-01 21:44:40

I didn't handle it and got AC.

Essam AlNaggar: 2009-06-10 21:52:48

can the same route be entered twice with different values ?

Last edit: 2009-06-10 21:53:37

Added by:Daniel Gómez Didier
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Circuito de Maratones ACIS / REDIS