Appeared in Lowes test
→ Обратите внимание
До соревнования
Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2)
4 дня
Зарегистрироваться »
Spectral::Cup 2026 Round 1 (Codeforces Round 1094, Div. 1 + Div. 2)
4 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.04.2026 00:52:42 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
It can be solved by a dynamic approach. In order to get an answer for vertex, we can calculate answers for all children and then multiply them.
$$$dp[v]$$$ — number of ways color black the subtree of $$$v$$$.
$$$dp[leaf] = 1$$$, for all leafs
$$$dp[v] = \prod (dp[child] + 1)$$$
You can calculate it by simple dfs. Answer will be in $$$dp[root]$$$
isn't it $$$dp[v] = 1 + \prod dp[child]$$$?
$$$v$$$ has to be black, and a child can contain no black node at all, this is why there are $$$(dp[child] + 1)$$$ variations from each child. Am I wrong?
root / \ a d / \ c bfor this the answer should be 10 ig.
when a is black, we can give c,b pair 4(2*2) different combinations. when a is white, c and b must be white . so here 4+1=5. 5 when d is white and 5 when d is black. so 5+5=10. as root can't be white ans will be 10
And by the algorithm above you get exactly this answer.
$$$dp[c] = dp[b] = dp[d] = 1$$$
$$$dp[a] = (1 + 1) * (1 + 1) = 4$$$
$$$dp[root] = (4 + 1) * (1 + 1) = 10$$$
I think we need to color the whole tree with black color, and what matters is the ordering of coloring.. So, this dp approach won't work .. As it does not take into account the relative ordering.
Can you please show a case where the above solution won't work?
I think in this problem you don't need to consider an order of coloring, as it is not states so. Also, the author mentioned in comments that the answer for a rooted tree with two children is $$$4$$$ that proves order not matter.
oops, thought the root could be colored white
https://atcoder.jp/contests/dp/tasks/dp_v Harder version of the same problem.
I added Walmart to my boycott list ;)
You might want to add Lowe's as well . This problem appeared in my set in Lowe's Hiring contest Round 1 .
This was the same question which was asked earlier in the LOWE's exam also. I solved it using DFS.
dp[v] = dp[v] * (dp[e] + 1) % M; Where dp[v] = 1 and !vis[e] then only the above line will be executed.