Hello, i am struggling to solve this problem from SPOJ. Can anybody give me some hints? Thanks in advance!
→ Pay attention
→ Streams
→ Top rated
| # | 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 |
→ Top contributors
| # | 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 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jul/27/2024 19:19:28 (k1).
Desktop version, switch to mobile version.
Supported by
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