GODFATHER

CodeChefOpen on judge ↗

You are given a rooted tree consisting of $n$ vertices numbered $1$ to $n$. The root of the tree is vertex number $1$. You are given $Q$ queries. The $i$-th query consists of a set of $k$ distinct vertices. In each query, you have to find the Godfather node. A Godfather node is a node in the given set which lies in the unique simple paths from all the $k$ vertices to the root. ###Input

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