← All problemsSign in

Crafty Coloring (Easy)

CodeChefRating 2199Open on judge ↗

**This is the easy version of the problem. The only difference between this version and the hard version is that here, the sum of $N\times M$ across all tests is bounded by $2\cdot 10^5$.** Alice and Bob want to play a game on a grid with $N$ rows and $M$ columns. The cell at the intersection of the $i$-th row and $j$-th column is denoted $(i, j)$. Initially, all cells of the grid are colored

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