異端開発室

This problem asks for the number of nodes not covered by any of the unioned subtrees after a sequence of operations. Each operation selects two nodes a and b, then marks all nodes in subtree(a) ∪ subtree(b). For each node v, we must compute how many operations affect it — i.e., how many times v appears in such unions — and finally output n − (n ...