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 | 4039 |
2 | tourist | 3841 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3590 |
5 | ecnerwala | 3542 |
6 | Benq | 3535 |
7 | orzdevinwang | 3526 |
8 | gamegame | 3477 |
9 | heuristica | 3357 |
10 | Radewoosh | 3355 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 160 |
3 | Um_nik | 160 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 153 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
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.