Lost In Graph Land

CodeChefOpen on judge ↗

You have arrived in Graph Land to meet your childhood friend. In Graph Land there are a number of buildings $N$ and each specific building is given a number according to the number of floors they have $h$. The structure of the whole graph land is such that there are only $N-1$ roads between the buildings. Your friend doesn't know his building number as he has shifted recently. So he has given you

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