You are given a tree,number X and each node have a number on it.You have to find some nodes a1,a2,a3 ... ,an such a2 is child of a1 ,a3 is child of a2,...an is child of an - 1 and a1 + a2 + ... + an closest number to X.We say x is child of y if it's in subtree with root in y. This problem was on Serbian state competition 2014. for seniors,could you give me any hints or pseudocode?
Пожалуйста, подпишитесь на официальный канал Codeforces в Telegram по ссылке https://t.me/codeforces_official.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | -is-this-fft- | 148 |
| 5 | atcoder_official | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 9 | TheScrasse | 144 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.07.2024 06:32:57 (j2).
Десктопная версия, переключиться на мобильную.
При поддержке
I have an Idea But i'm not Sure about it ,i hope it helps you. Do a Dfs , and save the sum of all nodes in an array called depth for exemple , and for each node do a Binery search in the depth array to find the closest parent a1 such sum from a1 to current node is X.