I've used dfs, but it is giving me WA. Where i need to do correction? My solution
# | 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 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
I've used dfs, but it is giving me WA. Where i need to do correction? My solution
Name |
---|
Have you tried the following:
Write a very naive and simple solution to the problem (maybe exponential complexity) (if you can, you may also just copy someone else's solution)
Write a program to generate thousands of small (!) test cases
Using those two, find a test case where your program gives the wrong answer
Use print statements or a debugger to see where exactly your program does the wrong thing.
98% of WAs and REs can be resolved this way. People here don't have time to delve into every code posted here, it's much harder to debug somebody else's code and being able to debug your own code is a valuable skill. It is also a very routine process that can be learned much faster than problem solving and algorithms.
Thank you for your advice. I have got my mistake!
In this problem, I have checked for one connected set, meanwhile there could be many connected set!