Problem: https://www.codechef.com/problems/HLD/
I was only able to come up with the simple O(n^2) DP. I went through the editorial but didn't fully understand it.
Can someone share their ideas/approaches.
Any help would be appreciated.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/19/2026 18:31:35 (g1).
Desktop version, switch to mobile version.
Supported by
Auto comment: topic has been updated by C21 (previous revision, new revision, compare).
Auto comment: topic has been updated by C21 (previous revision, new revision, compare).
EDIT: Nevermind, I'm dumb.
Can you explain it in a bit more detail. Why log N times and how it's useful.
Nevermind, you're right. I'll get back to you if I'm able to think about the answer.
I think you have misread the problem. We have to mark the edges heavy/light to get the minimum cost.
Any updates