i have tried a lot but not able to construct the tree. i am not able to understand the code please can any one make me understand in easy language.
# | 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 |
i have tried a lot but not able to construct the tree. i am not able to understand the code please can any one make me understand in easy language.
Name |
---|
The solution is into $$$3$$$ parts:
Making straight chain, so $$$1$$$ node each at a height of $$$0,1,\ldots,p$$$.
Adding $$$n-p-2$$$ nodes at height $$$1$$$.
Adding the remaining $$$1$$$ node at height which satisfy the score constraint.
Do read the tester's code instead, my code was an alternate lengthy solution.