| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
Help in dfs problem Kefa and Park
I am unable to figure out which test case I m missing. Need help although I have solved it using bfs but wanted to master dfs as well.I am a beginner in graphs. Thanks in advance :) .
[submission:https://mirror.codeforces.com/contest/580/submission/94433974]
given above is the submission link .
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
kanisht_09 | 2020-10-01 23:23:21 | 13 | ||
| en1 |
|
kanisht_09 | 2020-10-01 23:22:14 | 331 | Initial revision (published) |
