| Task: | Ruudukko | 
| Sender: | AnttiE | 
| Submission time: | 2022-10-31 15:16:49 +0200 | 
| Language: | Node.js | 
| Status: | READY | 
| Result: | 28 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 28 | 
| #2 | WRONG ANSWER | 0 | 
| #3 | WRONG ANSWER | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.11 s | 1, 2, 3 | details | 
| #2 | ACCEPTED | 0.11 s | 1, 2, 3 | details | 
| #3 | ACCEPTED | 0.11 s | 1, 2, 3 | details | 
| #4 | ACCEPTED | 0.13 s | 2, 3 | details | 
| #5 | WRONG ANSWER | 0.34 s | 2, 3 | details | 
| #6 | WRONG ANSWER | 0.36 s | 2, 3 | details | 
| #7 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #8 | TIME LIMIT EXCEEDED | -- | 3 | details | 
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details | 
Code
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 a = 0; a < n; a++) {
    if (grid[a][c] < v) next.push([a, c]);
    if (grid[r][a] < v) next.push([r, a]);
  }
  let s = next.length;
  for (const [r2, c2] of next) {
    s += routes(r2, c2);
  }
  memo.set(k, s);
  return s;
}
let sum = n**2;
for (let r = 0; r < n; r++) {
  for (let c = 0; c < n; c++) {
    sum += routes(r, c);
  }
}
console.log((sum % ((10**9)+7)).toString());
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 1 1 1 1 1 1 1 1 1  | 
| correct output | 
|---|
| 9 | 
| user output | 
|---|
| 9 | 
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 1 2 3 6 5 4 7 8 9  | 
| correct output | 
|---|
| 135 | 
| user output | 
|---|
| 135 | 
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 3 7 8 1 4 5 4 3 9 6  | 
| correct output | 
|---|
| 57 | 
| user output | 
|---|
| 57 | 
Test 4
Group: 2, 3
Verdict: ACCEPTED
| input | 
|---|
| 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...  | 
| correct output | 
|---|
| 10000 | 
| user output | 
|---|
| 10000 | 
Test 5
Group: 2, 3
Verdict: WRONG ANSWER
| input | 
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 187458477 | 
| user output | 
|---|
| NaN | 
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
| input | 
|---|
| 100 2995 8734 1018 2513 7971 5063 ...  | 
| correct output | 
|---|
| 964692694 | 
| user output | 
|---|
| 456761673 | 
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...  | 
| correct output | 
|---|
| 1000000 | 
| user output | 
|---|
| (empty) | 
Test 8
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...  | 
| correct output | 
|---|
| 229147081 | 
| user output | 
|---|
| (empty) | 
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 1000 520283 805991 492643 75254 527...  | 
| correct output | 
|---|
| 951147313 | 
| user output | 
|---|
| (empty) | 
