| 169 | return ans; |
| 170 | } |
| 171 | long long component_sum(int u) { |
| 172 | return t[find_root(u)].subsum; |
| 173 | } |
| 174 | long long subtree_sum(int u) { |
| 175 | int p = get_parent(u); |
| 176 | if (p == 0) { |
nothing calls this directly
no outgoing calls
no test coverage detected