Single Source Shortest Path

Points: 7

Time limit: 2.0s

Memory limit: 256M

Author:

FatalEagle

Problem type

Problem Description

Solve the Single Source Shortest Path problem.

Input Specification

Line 1: $N$ ~N~ $(2 \le N \le 1\,000)$ ~(2 \le N \le 1\,000)~ (vertices), $M$ ~M~ $(1 \le M \le 5\,000)$ ~(1 \le M \le 5\,000)~ (bidirectional edges)

Lines 2 to $M+1$ ~M+1~: $u_i, v_i, w_i$ ~u_i, v_i, w_i~ $(1 \le u_i, v_i \le N, 1 \le w_i \le 10\,000)$ , a bidirectional edge from $u_i$ ~u_i~ to $v_i$ ~v_i~ with weight $w_i$ ~w_i~. Multiple edges between the same pair of vertices may occur in the input.

Output Specification

Lines 1 to N: line $i$ ~i~ has the length of the shortest path from vertex $1$ ~1~ to vertex $i$ ~i~. If no path exists, output $-1$ ~-1~.

Sample Input

Sample Output

Comments

0

yaxollum commented on Feb. 5, 2019, 5:50 p.m.

Is there something wrong with my implementations of Dijkstra's? How come Bellman-Ford is two times faster?
1

juho commented on Jan. 24, 2018, 12:14 p.m.

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.

2

xiaowuc1 commented on Jan. 24, 2018, 1:08 p.m.

Your C++ code is quite different from your Python code. Please reread the problem description.

2

juho commented on Jan. 24, 2018, 5:14 p.m.

I am actually dumb, I forgot that "Multiple edges between the same pair of vertices may occur in the input." Thanks for the reply.

0

haoda commented on Feb. 25, 2017, 11:50 a.m. ← edited →

.

7

Xyene commented on Feb. 25, 2017, 11:58 a.m.

a bidirectional edge from $u_i$ ~u_i~ to $v_i$ ~v_i~ with weight $w_i$ ~w_i~.

So, undirected.

1

haoda commented on Feb. 25, 2017, 12:05 p.m.

thanks

-41

moladan123 commented on Jan. 17, 2016, 2:57 p.m. ← edit 2 →

.

This comment is hidden due to too much negative feedback. Click here to view it.