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.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 160 |
2 | maomao90 | 160 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
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.
Name |
---|
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