← All problemsSign in

Equal Median

CodeChefRating 2973Open on judge ↗

You are given a sequence of integers $A_1, A_2, \ldots, A_N$. You should process $Q$ queries. In each query: - You are given two integer parameters $id$ and $v$. - Change the value of $A_{id}$ to $v$. - Then, consider all ways to partition the sequence $A_1, A_2, \ldots, A_N$ into multisets $M_1, M_2, \ldots, M_K$ (for an arbitrary $K \ge 1$) such that: - Each element of $A$ is assigned to exa

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