Hello, i am struggling to solve this problem from SPOJ. Can anybody give me some hints? Thanks in advance!
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
Name |
---|
You could change the problem by preprocessing the tree and answering how many nodes in a subtree have a tag ≤ k
To do this, you can collapse the tree using an Euler tour with a segment tree and order the query's to answer them in order (query (id, a, b, x) = (new_query (id, a, x), new_query(id, b, X)) to respond separately) Euler tour, segment tree or bit
i think we can't preprocess the tree, because we have to answer the query online. CMIIW
yeah..., but this is possible