Rootless Tree

CodeChefOpen on judge ↗

You are given a tree with $N$ nodes, with each node numbered uniquely with 1..N. Movement from a particular node to its parent(if exists) is the only allowed move and it costs 1 rupee. That is from any node $U$ we can go to parent(U) in 1 rupee, parent(parent(U)) in 2 rupees, parent(parent(parent(U))) in 3 rupees etc. We have $Q$ queries of the form $r$, $u$, $v$ and each query is interpreted as

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