5 - Ideal octopuses
CodeChefOpen on judge ↗
You are given a rooted tree with $n$ vertices and root vertex $1$. Each other vertex $2 \leq i \leq n$ has parent vertex $1 \leq p_i
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