Grid x Grid

CodeChefOpen on judge ↗

Alice was given a grid of size N×M. The rows are numbered from 1 to N, and the columns from 1 to M. Each cell of the grid has a value assigned to it; the value of cell (i, j) is Aij. He will perform the following operation any number of times (possibly zero): He will select any path starting from (1,1) and ending at (N, M), such that if the path visits (i, j), then the next cell visited must be (

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