Task: | Ruudukko |
Sender: | drvilepis |
Submission time: | 2022-11-03 13:55:30 +0200 |
Language: | Rust |
Status: | READY |
Result: | 28 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 28 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | TIME LIMIT EXCEEDED | 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 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#6 | TIME LIMIT EXCEEDED | -- | 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 variable: `s` --> input/code.rs:16:36 | 16 | let grid = (0..grid_size).map(|s| { | ^ help: if this is intentional, prefix it with an underscore: `_s` | = note: `#[warn(unused_variables)]` on by default warning: function is never used: `as_index` --> input/code.rs:3:4 | 3 | fn as_index(grid_size: usize, x: usize, y: usize) -> usize { | ^^^^^^^^ | = note: `#[warn(dead_code)]` on by default warning: unused `Result` that must be used --> input/code.rs:11:5 | 11 | 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:17:9 | 17 | stdin.read_line(&mut input); | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ | = note: this `Result` may be an `Err` variant, which should be handled warning:...
Code
const MODULO: usize = 1_000_000_007; fn as_index(grid_size: usize, x: usize, y: usize) -> usize { x + y * grid_size } 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 grid = (0..grid_size).map(|s| { 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]; match num { 1 => 1, _ => recurse(&grid, grid_size, x, y, num) + 1, } }).sum::<usize>() }).sum::<usize>(); println!("{ans}"); } fn recurse(grid: &Vec<Vec<usize>>, grid_size: usize, x: usize, y: usize, val: usize) -> usize { (0..x).chain(x+1..grid_size).map(|i| { match grid[y][i] { 1 => 1, num if num < val => recurse(grid, grid_size, i, y, num) + 1, _ => 0, } }).sum::<usize>() % MODULO + (0..y).chain(y+1..grid_size).map(|i| { match grid[i][x] { 1 => 1, num if num < val => recurse(grid, grid_size, x, i, num) + 1, _ => 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: TIME LIMIT EXCEEDED
input |
---|
100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
187458477 |
user output |
---|
(empty) |
Test 6
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100 2995 8734 1018 2513 7971 5063 ... |
correct output |
---|
964692694 |
user output |
---|
(empty) |
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) |