| # | 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 | 170 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | adamant | 154 |
| 7 | Dominater069 | 154 |
| 9 | awoo | 153 |
| 10 | luogu_official | 152 |
Problem statement : http://codeforces.net/contest/842/problem/E
How is the tree structure generated in the problem? (I am confused by the words "level" and "classes". Do they mean the same thing?)
Also, the input section describes "queries"? AFAICS, the queries contain the information to build the tree (submissions by other contestants). The sample test cases do not have any explanations, which makes is hard for me to understand the question.
Thank you for your time and attention.
Submission under review : http://codeforces.net/contest/767/submission/24809891
For problem : http://codeforces.net/contest/767/problem/C
Which cases am I missing? I tried to implement the two conditions as given in the tutorial but the submission fails for test 9 (which is a large one, i cannot debug by viewing the case).
Thank you for your time and attention
