Minimum Chocolates

CodeChefOpen on judge ↗

There is $N$ . $M$ grid where in each cell there is a single student. Your task is to $Minimize$ $The$ $Number$ of $Chocolates$ to be distributed to Students . One Chocolate can be Shared with Atmost 4 adjacent cells . One Chocolate Will Be Placed In The Middle Of $X$ Students Sharing A $Common$ $Edge$ Or $Side$ Where $X$ can be Atmost $4$ . For Example : - Consider a Grid Of $2$ x $2$ Let The

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