EZDIJKST - Easy Dijkstra Problem

no tags 

Determine the shortest path between the specified vertices in the graph given in the input data.
Hint: You can use Dijkstra's algorithm.
Hint 2: if you're a lazy C++ programmer, you can use set and cin/cout (with sync_with_stdio(0)) - it should suffice.

Input

first line - one integer - number of test cases
For each test case the numbers V, K (number of vertices, number of edges) are given,
Then K lines follow, each containing the following numbers separated by a single space:
ai, bi, ci
It means that the graph being described contains an edge from ai to bi,
with a weight of ci.
Below the graph description a line containing a pair of integers A, B is present.
The goal is to find the shortest path from vertex A to vertex B.
All numbers in the input data are integers in the range 0..10000.

Output

For each test case your program should output (in a separate line) a single number C - the length of the shortest path from vertex A to vertex B. In case there is no such path, your program should output a single word "NO" (without quotes)

Example

Input:
3
3 2
1 2 5
2 3 7
1 3
3 3
1 2 4
1 3 7
2 3 1
1 3
3 1
1 2 4
1 3

Output:
12
5
NO

hide comments
Kishlay Raj: 2014-07-03 09:27:39

is the number of nodes in the test cases more than 1000 too

Last edit: 2014-07-03 09:27:52
tranquil: 2014-05-25 09:07:14

it is a directed graph....costed me 2 WA's

kelaseek: 2014-05-23 12:03:38

no need of anything .. just dijkstra

anti_tourist: 2014-03-16 21:58:10

Please provide any tricky test case ???

Last edit: 2014-03-16 22:17:26
Rana Saha: 2013-11-12 20:15:46

weak test cases!

Geanyous: 2013-10-27 17:48:13

get AC for first submission with SPFA lol

Josué: 2013-02-08 03:53:50

It's a directed graph, that's why i was getting WA

Kumar Mrinal: 2012-12-25 18:38:31

gets AC with a noob implementation of Dijkstra, no need of heap nthing :)

Anick Saha: 2012-11-28 20:02:32

guys, be careful wd one thing...it's a directed graph.. // ;-)

Rafael: 2012-11-03 23:33:42

getting SIGKILL also for no reason
submission 7989024


Added by:Robert Rychcicki
Date:2009-01-10
Time limit:0.150s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS OBJC PERL6 VB.NET