Family Tree

CodeChefOpen on judge ↗

Chef's father told Chef to remember his family tree. His family tree contains $N$ vertices and $N-1$ edges representing a relationship between the family members. $As$ $it$ $is$ $family$ $tree,$ $so$ $edges$ $is$ $considered$ $to$ $be$ $directed$ $from$ $u$ $to$ $v.$ $(That$ $means$ $u$ $is$ $parent$ $of$ $v$, $but$ $vice$ $versa$ $is$ $not$ $true.)$ Now, Chef's father asked $Q$ questions to Ch

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.

voice by Sarvam AI