Task: | Ruudukko |
Sender: | drvilepis |
Submission time: | 2022-11-03 14:55:54 +0200 |
Language: | Rust |
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.00 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.00 s | 2, 3 | details |
#5 | WRONG ANSWER | 0.01 s | 2, 3 | details |
#6 | WRONG ANSWER | 0.02 s | 2, 3 | details |
#7 | ACCEPTED | 0.03 s | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
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:15:9 | 15 | stdin.read_line(&mut input); | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ | = note: this `Result` may be an `Err` variant, which should be handled warning: 2 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 answers = vec![vec![0; grid_size]; grid_size];let grid = (0..grid_size).map(|_| {stdin.read_line(&mut input);let out = input.split_whitespace().map(|n| n.parse::<usize>().unwrap()).collect::<Vec<_>>();input.clear();out}).collect::<Vec<_>>();let ans = (0..grid_size).map(|x| {(0..grid_size).map(|y| {let num = grid[y][x];if num == 1 {return 1;}(match answers[y][x] {0 => {let res = (recurse(&grid, &mut answers, grid_size, x, y, num) + 1) % MODULO;answers[y][x] = res;res}n => n,} % MODULO)}).sum::<usize>()}).sum::<usize>();println!("{ans}");}fn recurse(grid: &Vec<Vec<usize>>, answers: &mut Vec<Vec<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 if num < val => {match answers[y][new_x] {0 => {let res = recurse(grid, answers, grid_size, new_x, y, num) + 1;answers[y][new_x] = res;res % MODULO},n => n}}_ => 0,}}).sum::<usize>() % MODULO+(0..y).chain(y+1..grid_size).map(|new_y| {match grid[new_y][x] {1 => 1,num if num < val => {match answers[new_y][x] {0 => {let res = recurse(grid, answers, grid_size, x, new_y, num) + 1;answers[new_y][x] = res;res},n => n}}_ => 0,}}).sum::<usize>() % MODULO}
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 |
---|
4969187493260 |
Test 6
Group: 2, 3
Verdict: WRONG ANSWER
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: 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) |