← All problemsSign in

Second MEX

CodeChefRating 2188Open on judge ↗

We define the $\operatorname{SMEX}$ value of a sequence as the $2^{nd}$ smallest non-negative integer that does not appear in the array. For example, $\operatorname{SMEX}([0, 1, 2, 3]) = 5$ and $\operatorname{SMEX}([1, 1]) = 2$. You are given an array $A$ of $N$ elements. Calculate the sum of $\operatorname{SMEX}$ values over all $2^N - 1$ non-empty subsequences$^{\dagger}$ of $A$. Since the an

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

Sign in to chat with the tutor and save your progress.

Sign in to start