← All problemsSign in

Thief and Police

CodeChefRating 1747Open on judge ↗

There is an $N$ by $M$ grid. A thief is trying to escape from a policeman. The thief is currently in cell $(x,y)$ in the grid, while the policeman is in cell $(a,b)$. Cells are numbered from $1$ to $N$, top to bottom, and $1$ to $M$, left to right. Both of them are at different cells initially. Both of them take turns alternatively. First it is the thief's turn, then the police's, and so on. Th

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