Chef and Tag

CodeChefRating 2383Open on judge ↗

You are given a tree with $N$ nodes and $K$ leaf nodes, **rooted** at node $1$. $K$ friends are stationed at node $1$, each aspiring to reach a **distinct** leaf node. Meanwhile, Chef can choose any one of the leaf nodes and start from that. Every second: - Firstly, each friend will move to one of the children of their current node in order to reach a distinct leaf node. - Once the friends hav

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