| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
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 :) .
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) |
