Ruudukko

const [[n], ...grid] = require("fs").readFileSync(0, "utf8").trim().split("\n").map(l => l.trim().split(" ").map(Number));

const key = (r, c) => `${r},${c}`;
const memo = new Map();

function routes(r, c) {
  const k = key(r, c);
  if (memo.has(k)) return memo.get(k);

  const v = grid[r][c];
  const next = [];
  for (let rc2 = 0; rc2 < n; rc2++) {
    if (grid[rc2][c] < v) next.push([rc2, c]);
    if (grid[r][rc2] < v) next.push([r, rc2]);
  }

  let s = 0;
  for (const [r2, c2] of next) {
    s += 1 + routes(r2, c2);
  }

  memo.set(k, s);
  return s;
}

let sum = 0;

for (let r = 0; r < n; r++) {
  for (let c = 0; c < n; c++) {
    sum += 1 + routes(r, c);
  }
}

console.log((sum % (10**9+7)).toString());

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 2, 3

Verdict: ACCEPTED

Test 5

Group: 2, 3

Verdict: WRONG ANSWER

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED