Garry and OR Tree

CodeChefOpen on judge ↗

Garry has a tree, consisting of n nodes, numbered from 1 to n. Each node has a value, either 0 or 1. Initially, node 1 has value=1 and all other nodes have value=0. Garry gives you q queries. Each query is of one of the following types:- 0 v : Calculate the smallest distance of node v from a node u, such that valueu=1.(Not that if valuev=1, then the answer=0). 1 v : Set value v to 1. Print th

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