| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
Hi, Codeforces. I've recently found an interesting problem:
Given an undirected tree with n vertices. Find out how many different ways you can orient the edges of the tree so that the result graph will contain exactly m vertices with zero outdegree modulo 109 + 7, (1 ≤ n ≤ 1000, 0 ≤ m ≤ n).
Could someone help me with this problem and explain the solution?
dp[v][cnt][flag] is the number of ways to make cnt vertices with zero outdegree in the subtree of v, and flag is 1 if the vertex v have a zero outdegree else it is 0 (so n * m * 2 memory)
to recalc this dp you just go with dfs and then you do knapsack-like solution like in this task 815C