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 | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
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.