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.
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
20:32:22
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
20:32:22
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 21:02:39 (j2).
Десктопная версия, переключиться на мобильную.
При поддержке
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