Cats and Tree
CodeChefOpen on judge ↗
You are given a rooted tree with $N$ nodes labelled $1$ through $N$. For each non-root node $i$, let's denote the direct parent of this node by $p_i$. $N$ cats, also labelled $1$ through $N$, have vanished from Chef's home. The cats are frightened, so they want to climb the tree one by one, in the order $C_1, C_2, \ldots, C_N$. At any time, each node may contain at most one cat. When cat $c$ want
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start