Hello, can anybody give me hints for this problem? I think heavy light decomposition could handle the type-1 query, but how about the type-2 query?
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
Name |
---|
My (author's) solution uses the fact that there are not many nodes having many children and nodes with not so many children are easy to handle.
Of course, as an author I don't want to reveal the full solution but I think this hint is enough for you to get it. I am happy to see many different approaches that didn't occur to me, including a good portion of HLD solutions.
Thanks for your hint. I'll try it again.
I solved this using this technique e.e in $$$O(n \log^2 n)$$$, I can optimize it to $$$O(n \log n)$$$ using this blog.