→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
4 дня
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
4 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 19.11.2024 18:30:52 (k3).
Десктопная версия, переключиться на мобильную.
При поддержке
Can anyone please help me out?
It's look like advanced tree problem.
Centroid decomposition is your friend ~
Could you talk more in detalis about how to use the Centroid Decomposition to solve these two problems above? Thank you very much!
check this out.
https://threads-iiith.quora.com/Centroid-Decomposition-of-a-Tree
Hope that helps. :)
This may or may not help :D ( By seening that you are involved in the conversation there aswell xD )
The topic in that conversation was only about Heavy Light Decomposition (HLD). I already knew about HLD, but I still can't find a way using it to solve QTREE4 and QTREE4. People in that conversation was trying to help someone else to implement it, NOT the Centroid Decomposition as no_motivation mentioned.
have you now know how to solve them using HLD?
If you know then please explain it. It will be of great use for beginners like me!
Can anyone help with HLD solution of above problems?