Ruudukko

warning: unused `Result` that must be used
 --> input/code.rs:7:5
  |
7 |     stdin.read_line(&mut input);
  |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  |
  = note: `#[warn(unused_must_use)]` on by default
  = note: this `Result` may be an `Err` variant, which should be handled

warning: unused `Result` that must be used
  --> input/code.rs:13:9
   |
13 |         stdin.read_line(&mut input);
   |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
   |
   = note: this `Result` may be an `Err` variant, which should be handled

warning: 2 warnings emitted

const MODULO: usize = 1_000_000_007;

fn main() {
    let stdin = std::io::stdin();

    let mut input = String::new();
    stdin.read_line(&mut input);

    let grid_size = input.trim().parse::<usize>().unwrap();
    input.clear();

    let mut grid = (0..grid_size).map(|_| {
        stdin.read_line(&mut input);
        let out = input.split_whitespace().map(|n| (n.parse::<usize>().unwrap(), 0usize)).collect::<Vec<_>>();
        input.clear();

        out
    }).collect::<Vec<_>>();

    let ans = (0..grid_size).map(|x| {
        (0..grid_size).map(|y| {
            let num = grid[y][x].0;
            if num == 1 {
                return 1;
            }

            (match grid[y][x].1 {
                0 => {
                    let res = recurse(&mut grid, grid_size, x, y, num) + 1;
                    grid[y][x].1 = res;
                    res
                }
                n => n,
            } % MODULO)
        }).sum::<usize>()
    }).sum::<usize>();

    println!("{ans}");
}

fn recurse(grid: &mut Vec<Vec<(usize, usize)>>, grid_size: usize, x: usize, y: usize, val: usize) -> usize {
    (0..x).chain(x+1..grid_size).map(|new_x| {
        match grid[y][new_x].0 {
            1 => 1,
            num if num < val => {
                match grid[y][new_x].1 {
                    0 => {
                        let res = recurse(grid, grid_size, new_x, y, num) + 1;

                        grid[y][new_x].1 = res;

                        res
                    },
                    n => n
                }
            }
            _ => 0,
        }
    }).sum::<usize>()
    +
    (0..y).chain(y+1..grid_size).map(|new_y| {
        match grid[new_y][x].0 {
            1 => 1,
            num if num < val => {
                match grid[new_y][x].1 {
                    0 => {
                        let res = recurse(grid, grid_size, x, new_y, num) + 1;

                        grid[new_y][x].1 = res;

                        res
                    },
                    n => n
                }
            }
            _ => 0,
        }
    }).sum::<usize>()
}

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: TIME LIMIT EXCEEDED

Test 6

Group: 2, 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED