Ruudukko

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

warning: 2 warnings emitted

use std::collections::BinaryHeap;
 
const MODULO: usize = 1_000_000_007;
 
#[derive(Eq)]
struct Node {
    x: usize,
    y: usize,
    value: usize,
}
 
impl Ord for Node {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        self.value.cmp(&other.value).reverse()
    }
}
 
impl PartialOrd for Node {
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        Some(self.value.cmp(&other.value).reverse())
    }
}
 
impl PartialEq for Node {
    fn eq(&self, other: &Self) -> bool {
        self.value.eq(&other.value)
    }
}
 
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 queue = BinaryHeap::new();
 
    let mut grid = (0..grid_size).map(|y| {
        stdin.read_line(&mut input);
        let out = input.split_whitespace().enumerate().map(|(x, n)| {
            let num = n.parse::<usize>().unwrap();
 
            queue.push(Node {
                x,
                y,
                value: num,
            });
 
            (num, 1usize)
        })
            .collect::<Vec<_>>();
        input.clear();
 
        out
    }).collect::<Vec<_>>();
 
    (0..grid_size).for_each(|_| {
        (0..grid_size).for_each(|_| {
            let node = queue.pop().unwrap();
            increment(&mut grid, grid_size, node.x, node.y);
        });
    });
 
    let ans = grid.into_iter().map(|l| l.into_iter().map(|(_, n)| n)).flatten().fold(0, |i, n| {
        let mut res = i + n;
        if res > MODULO { res -= MODULO }
        res
    });
 
    println!("{ans}");
}
 
fn increment(grid: &mut Vec<Vec<(usize, usize)>>, grid_size: usize, x: usize, y: usize) {
    let (num, value) = grid[y][x];
 
    (0..x).chain(x+1..grid_size).for_each(|new_x| {
        let (other_num, other_value) = grid[y][new_x];
        if other_num > num {
            let mut new_value = value + other_value;
            if new_value > MODULO { new_value -= MODULO }
            grid[y][new_x].1 = new_value;
        };
    });
 
    (0..y).chain(y+1..grid_size).for_each(|new_y| {
        let (other_num, other_value) = grid[new_y][x];
        if other_num > num {
            let mut new_value = value + other_value;
            if new_value > MODULO { new_value -= MODULO }
            grid[new_y][x].1 = new_value;
        };
    });
}

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: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED