| # | 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 | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
I didn't understand the editorial of the question.
https://mirror.codeforces.com/contest/1941/problem/G
Can anyone help me to get an idea of the solution, and why they are using these techniques to get the solution? How by using this we are getting the required answer.
In editorial, it asks you to make bipartite graph of stations and subway line. Once you reach a subway line, you can reach all the stations connected to it without incurring extra costs. Now how will you reach from source station to destination station?
Why is the answer of
1 -> 3 = 1and1 -> 6 = 2? Think about that.Finally Understood... Thanks:)