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 | tourist | 4009 |
| 2 | jiangly | 3821 |
| 3 | Benq | 3736 |
| 4 | Radewoosh | 3631 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3388 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/10/2024 09:52:05 (g1).
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.