[Codeforces894D]Ralph And His Tour in Binary Country
题意给定有nnn个节点的树,节点iii与⌊i2⌋\lfloor\fraci2\rfloor⌊2i⌋有距离为LiL_iLi的边。mmm次询问,每次询问给出A,HA,HA,H若某个节点到AAA的距离LLL小于HHH,则会产生H−LH-LH−L的贡献,求树上所有点与AAA产生的贡献之和。n≤106,m≤105n\le10^6,m\le10^5n≤106,m≤105题解这棵树是一颗完全二叉树.设depu{