UCV2013B — Alice in Amsterdam, I mean Wonderland
This is a graph problem from spoj
Can anyone tell me how to solve it??
Link :https://www.spoj.com/problems/UCV2013B/
Thanks in advance
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
UCV2013B — Alice in Amsterdam, I mean Wonderland
This is a graph problem from spoj
Can anyone tell me how to solve it??
Link :https://www.spoj.com/problems/UCV2013B/
Thanks in advance
Name |
---|
Solve using Floyd-Warshall algorithm with a special case of containing a negative cycle.
https://cp-algorithms.com/graph/all-pair-shortest-path-floyd-warshall.html
If there exists a negative cycle, running the algorithm two times will produce lower distance than running it once (or as the blog says, the distance from a vertex to itself will be negative).
I advise you read the algorithm first, then handle the case with negative cycles.