Solve the Single Source Shortest Path problem.
Input Specification
Line :
(vertices),
(bidirectional edges)
Lines to
:
, a bidirectional edge from
to
with weight
. Multiple edges between the same pair of vertices may occur in the input.
Output Specification
Lines to
: line
has the length of the shortest path from vertex
to vertex
. If no path exists, output
-1
.
Sample Input
4 3
1 2 2
1 3 5
2 3 2
Sample Output
0
2
4
-1
Comments
Aside from the TLEs can anyone find out why my code is giving blatantly wrong answers? I don't seriously expect to be able to fix the TLEs but I just want this program to give correct answers.
Nevermind, I forgot about the overlapping edges or whatever.
Like how are the nodes linked?
thank you!
Can someone please tell me what is wrong with my c++ code? I just translated my Python Code, which passed with AC, into a c++ one, but it gets the majority of the cases wrong. Thanks in advance.
Your C++ code is quite different from your Python code. Please reread the problem description.
I am actually dumb, I forgot that "Multiple edges between the same pair of vertices may occur in the input." Thanks for the reply.
This comment is hidden due to too much negative feedback. Show it anyway.
So, undirected.
thanks