BATMAN AND Harvey

CodeChefOpen on judge ↗

Harvey Dent got tired of playing game by the usual rules so to mock Batman he made a little modification to it. Now the game should be played on an undirected rooted tree of n vertices. Vertex 1 is the root of the tree. Harvey starts at vertex 1 and Batman starts at vertex x (x ≠ 1). The moves are made in turns, Batman goes first. In one move one can either stay at the current vertex or travel to

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