CSES - Datatähti 2023 alku - Results
Submission details
Task:Ruudukko
Sender:drvilepis
Submission time:2022-11-03 15:30:51 +0200
Language:Rust
Status:READY
Result:28
Feedback
groupverdictscore
#1ACCEPTED28
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#2ACCEPTED0.00 s1, 2, 3details
#3ACCEPTED0.00 s1, 2, 3details
#4ACCEPTED0.00 s2, 3details
#50.01 s2, 3details
#60.02 s2, 3details
#7ACCEPTED0.04 s3details
#8--3details
#9--3details

Compiler report

warning: variable does not need to be mutable
  --> input/code.rs:12:9
   |
12 |     let mut max = 0usize;
   |         ----^^^
   |         |
   |         help: remove this `mut`
   |
   = note: `#[warn(unused_mut)]` on by default

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:16:9
   |
16 |         stdin.read_line(&mut input);
   |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
   |
   = note: this `Result` may be an `Err` variant, which should be handled

warning: 3 warnings emitted

Code

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 {
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)
}).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] {
(1, _) => 1,
(num, cache) if num < val => {
match cache {
0 => {
let res = (recurse(grid, grid_size, new_x, y, num) + 1) % MODULO;
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) % MODULO;
grid[new_y][x].1 = res;
res
},
n => n
}
}
_ => 0,
}
}).sum::<usize>()
}

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:

input
100
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
187458477

user output
4954141017743

Test 6

Group: 2, 3

Verdict:

input
100
2995 8734 1018 2513 7971 5063 ...

correct output
964692694

user output
4458964723900

Test 7

Group: 3

Verdict: ACCEPTED

input
1000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
1000000

user output
1000000

Test 8

Group: 3

Verdict:

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:

input
1000
520283 805991 492643 75254 527...

correct output
951147313

user output
(empty)