Hello, i am struggling to solve this problem from SPOJ. Can anybody give me some hints? Thanks in advance!
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
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