Given a tree with N vertices. There are Q queries, the ith query is represented by K pairs (v, r), all vertices whose distance from v is not more than r will be marked. Ask how many vertices are marked per query.↵
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 |
![]() |
sadboi2009 | 2024-05-10 19:09:15 | 20 | ||
en1 |
![]() |
sadboi2009 | 2024-05-10 19:07:46 | 464 | Initial revision (published) |