Ruudukko

warning: unnecessary parentheses around assigned value
  --> input/code.rs:43:31
   |
43 |                     let res = (recurse(&mut grid, grid_size, x, y, num) + 1);
   |                               ^                                            ^
   |
   = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
   |
43 -                     let res = (recurse(&mut grid, grid_size, x, y, num) + 1);
43 +                     let res = recurse(&mut grid, grid_size, x, y, num) + 1;
   | 

warning: unnecessary parentheses around assigned value
  --> input/code.rs:62:35
   |
62 |                         let res = (recurse(grid, grid_size, new_x, y, num) + 1);
   |                                   ^                                           ^
   |
help: remove these parentheses
   |
62 -                         let res = (recurse(grid, grid_size, new_x, y, num) + 1);
62 +                         let res = recurse(grid, grid_size, new_x, y, num) + 1;
   | 

warning: unn...

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 max = 0usize;
    let mut coords = (0usize, 0usize);
 
    let mut grid = (0..grid_size).map(|x| {
        stdin.read_line(&mut input);
        let out = input.split_whitespace().enumerate().map(|(y, n)| {
            let num = n.parse::<usize>().unwrap();
 
            if num > max {
                max = num;
                coords = (x, y);
            }
 
            (num, 0usize)
        })
        .collect::<Vec<_>>();
        input.clear();
        out
    }).collect::<Vec<_>>();
 
    recurse(&mut grid, grid_size, coords.0, coords.1, max);
 
    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)
        }).fold(0, |i, n| (i + n % MODULO))
    }).fold(0, |i, n| (i + n % MODULO));
 
    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] {
            (1, _) => 1,
            (num, cache) if num < val => {
                match cache {
                    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] {
            (1, _) => 1,
            (num, cache) if num < val => {
                match cache {
                    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