← All problemsSign in

Town or Road

In the Seven Kingdoms, there are $N$ towns and $N-1$ roads connecting them. Each town is numbered from $1$ to $N$. The $i$-th road connects town $a_i$ and town $b_i$. All roads have the same length, and it is possible to reach any town from any other town by using some roads. You are given $Q$ queries, where each query has two integers, $c_i$ and $d_i$. Daenerys Targaryen is at town $c_i$, and

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

Sign in to chat with the tutor and save your progress.

Sign in to start