Interactive Tree

CodeChefRating 2822Open on judge ↗

*This problem is similar to the problem **"INTREECTIVE2"**. The only difference between them is the **number of queries** allowed — in this problem, up to **21 queries** can be made. In **Div. 1 and Div. 2** this problem is worth **40 points** and **"INTREECTIVE2"** is worth **60**. In **Div. 3** this problem is **non-scorable**.* **This is an interactive task** You are given a tree consisti

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