WIN IT

CodeChefOpen on judge ↗

You want to propose a girl named Cecile, but she is not a fool, she wants an intelligent boyfriend. So, she asks you to solve a problem in order to be her boyfriend. You are given an array (Indexing starts from 1) consisting of $N$ numbers and you are asked $M$ queries of two types. The following are the two types of queries. $1$ $X$ $Y$ ∶-Change the element of the array at position $X$ to $

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