| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | adamant | 157 |
| 6 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | djm03178 | 153 |
Hello guys, I was solving this problem (http://codeforces.me/contest/161/problem/D).
After trying for sometime , I read the editorial of the problem and I am not being able to understand the meaning of this line.
Can anyobdy help me with this?
I basically want to understand about logic or proof behind this.
If you fix son u of vertex v and distance x to the v, you can choose vertex with distance to the v k — x in subtree of other son of v. d[u][x — 1] is number of vertices in subtree of u with distance x — 1(becomes x when you move from u to v). d[v][k — x] is number of vertices in subtree of v with distance k — x, you subtract d[u][k — x — 1] to exclude vertices in subtree of u. Also *0.5 is because each pair is counted twice.