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 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 162 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 154 |
8 | pajenegod | 147 |
9 | BledDest | 145 |
9 | Um_nik | 145 |
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.