Hello codeforces! can anyone explain me the test case of this question ? Thanks in advance :)
Hello codeforces! can anyone explain me the test case of this question ? Thanks in advance :)
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
consider the graph of the test case.
you notice that number of groups is max number of levels which will be 3 in this case because: level 1: nodes 1,5. level 2 : nodes 2,4. level 3 : nodes 3.
which will form groups in it there are not any superior of another in same group. to calculate answer you will use bfs algorithm for graph .
hope it well.
Thanks
@beethoven97
for helping me....yeah now it is clear :)