Naruto Run

CodeChefOpen on judge ↗

Naruto wants to visit $N$ villages. Since he is busy, he will be sending his clones instead. He can make as many clones as he wants. In fact, his clones can also make clones. In particular, two villages are connected if there is a path in between them. Each village has a number between $1$ to $N$ (inclusive). They are connected by paths. The whole network of village is in the form of a tree with

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