Can someone please help me with the solution of this problem? (https://www.hackerrank.com/contests/h42-prelims-1/challenges/will-and-good-trees)
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 151 |
Can someone please help me with the solution of this problem? (https://www.hackerrank.com/contests/h42-prelims-1/challenges/will-and-good-trees)
Name |
---|
Make array P, where P[u] is sum of elements on path 1->u. Now problem is to check if there are u, v such that P[u] — P[v] = k. To solve it use dfs and store cnt structure.
When you are visiting u, cnt[x] will be the count of such v that P[v] = x and v belongs 1->u. If there is such u that cnt[P[u]-k] isn't zero, tree is good. All you need is to modify cnt to make it valid.
There is some code, i didn't check it: link