All challenges

Reconstruct hidden weighted trees through the original Frontier-CS distance-query interaction.

Sort a permutation on a tree using parallel matching swaps with as few rounds as possible.

Choose a vertex service order on a tree whose removals flip unserviced neighbors.

Find the two anomaly nodes in each tree source case.

Slide tiles so the resulting line drawing contains a large tree.

Recover hidden node signs in a rooted tree using path-sum and toggle queries.

Navigate an infinite colored tree to the exit through the original interactive distance device.

Build a bounded-size tree of small vertex sets that covers tree and outer-ring edges.

Install subtree retuners on a rooted tree to improve prime-residue observatory coverage.

Compute the total weight in a heap-indexed tree source instance.