Hello, i am struggling to solve this problem from SPOJ. Can anybody give me some hints? Thanks in advance!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Название |
---|
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