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 | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 150 |
6 | atcoder_official | 148 |
6 | SecondThread | 148 |
8 | nor | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
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.