| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 163 |
| 2 | cry | 161 |
| 3 | maomao90 | 160 |
| 4 | -is-this-fft- | 159 |
| 5 | awoo | 158 |
| 6 | atcoder_official | 157 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 148 |
Yet Another Tree Problem
I am stuck on this following problem:
Given an undirected tree of n nodes and q queries of type (u,d), for each query you need find the number of simple paths starting from node u and having distance <=d.
Constraints:
1<=n,q,u,d<=100000
Any suggestion will be highly appreciated. Thanks.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Tyler__Durden | 2018-11-28 01:02:04 | 5 | Tiny change: 'nd having distance ' -> 'nd having edge distance ' | |
| en1 |
|
Tyler__Durden | 2018-11-28 00:59:34 | 327 | Initial revision (published) |
