Complicated Queries

CodeChefOpen on judge ↗

You are given a sequence of size $N$ (1 - indexed). You are given $Q$ queries. Each query can be of 3 types: - 1 L R x - for which you have to output $\sum_{i = L}^{i = R} \big( A[i] \& x \big)$ - 2 L R x - for which you have to output $\sum_{i = L}^{i = R} \big( A[i] \oplus x \big)$ - 3 k v - for which you have to set $A[k] = v$ **Notes:** - $\&$ denotes bitwise [AND](https://en.wikipedia.org/wi

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