Harsh and His India Tour

CodeChefOpen on judge ↗

Harsh is a dancer and he is going for India tour to perform. During tour he will be visiting many cities. There is exactly one person living in each city of India. Cities in India are numbered from 1 to N and they are connected in form of tree, where city 1 being the root of the tree .The roads are unidirectional such that we can only go from a city to its parent city but not vice versa. People

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