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 | 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 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
7 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 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.