Game of Spike and Tyke

CodeChefOpen on judge ↗

Tom and Jerry enjoy watching dogs play. Today, they noticed two dogs who play the following game. There is a rooted tree of $N$ nodes, $M$ of which are leaf nodes, edges of the tree are directed from parent to children. In the leaves of the tree integers from 1 to $M$ are placed in such a way that each number appears exactly in one leaf. Initially, the root of the tree contains a **bone**. Two

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