Tree MEX

CodeChefOpen on judge ↗

Minimum excludant (or MEX for short) of a collection of integers is the smallest non-negative integer not present in the set. You have a tree $T$ with $n$ vertices. Consider an ordering $P = (v_1, \ldots, v_n)$ of vertices of $T$. We construct a sequence $A(P) = (a_1, \ldots, a_n)$ using the following process: - Set all $a_i = -1$. - Process vertices in order $v_1, \ldots, v_n$. Fo

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