Can all the heavy-light decomposition (HLD) problems be solved using Binary lifting technique or do I need to learn HLD too? Thanks for helping, I am new to this field.
Extra: Stress away
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | jiangly | 3578 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | tourist | 3565 |
| 8 | maroonrk | 3531 |
| 9 | Radewoosh | 3521 |
| 10 | Um_nik | 3482 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 8 | SecondThread | 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: May/01/2024 06:36:09 (k1).
Desktop version, switch to mobile version.
Supported by
HLD seems to be more difficult and has worse complexity, but it's somehow well-known. Of course, there exists a problem, that requires HLD.
To be more certain, binary lifting technique allows you to calculate some value over some path. Heavy-light decomposition allows it too, but it also allows updates. You can't update fast all precomputed values for binary lifting. If $$$n = 2^k$$$ for some $$$k$$$, there could be $$$n / 2$$$ ways of length $$$n / 2$$$ over a vertex. It is already too many.