First To Last

CodeChefRating 2624Open on judge ↗

Chef has a grid of size $N \times M$. In one move, Chef can move from his current cell to an adjacent cell. If the Chef is currently at $(i, j)$ then, in one move, Chef can move to $(i + 1, j), (i - 1, j), (i, j + 1)$ or $(i, j - 1)$. There are also $K$ *special* cells in the grid. These special cells support a corner move as well. If the Chef is currently at a *special* cell $(i, j)$ then, in

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