Can anyone who solved this problem explain how to solve subtask 2 and full solution please ? https://oj.uz/problem/view/BOI17_catinatree
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/27/2024 12:04:26 (j1).
Desktop version, switch to mobile version.
Supported by
Auto comment: topic has been updated by youssefbou62 (previous revision, new revision, compare).
Same problem with weights on nodes : Link
Here's the O(n) solution described as well as the subtasks : Link
keep taking the deepest node.Invalidate all nodes with with distance <=d from that node.
centroid decomposition
for each node in the centroid tree keep all the nodes in its subtree in sorted order by distance from it in ascending order
when invalidating a node check check it and all of its parents in the centroid tree and start invalidating from the first node not already invalidated if the distance<=d.keep increasing the counter
https://oj.uz/submission/244589 O(n*logn*logn)