给定一个有根树,每次给定 $p,k$,询问有多少个三元组满足:
$n,q\le 3\times 10^5$
LCuter
有问题联系 QQ 494732835
Posts
69
Categories
24
Tags
53
CodeForces
SCOI
AtCoder
Update your browser to view this website correctly. Update my browser now
×