Task: | Ruudukko |
Sender: | fireplank |
Submission time: | 2022-11-13 21:21:37 +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.01 s | 2, 3 | details |
#5 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#6 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#7 | TIME LIMIT EXCEEDED | -- | 3 | details |
#8 | TIME LIMIT EXCEEDED | -- | 3 | details |
#9 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
use std::io; use std::thread; use std::cmp::min; fn recurse(y: usize, x: usize, array: &Vec<Vec<i32>>) -> i64 { let mut paths = 1; for (index, i) in array[y].iter().enumerate() { if i < &array[y][x] { paths += recurse(y, index, array); } } for (index, i) in array.iter().enumerate() { if i[x] < array[y][x] { paths += recurse(index, x, array); } } return paths; } fn split(a: usize, n: usize) -> Vec<(usize, usize)> { let k = a / n; let m = a % n; let mut v = Vec::new(); for i in 0..n { let start = i * k + min(i, m); let end = (i + 1) * k + min(i + 1, m); v.push((start, end)); } v } fn main() { let mut input = String::new(); io::stdin().read_line(&mut input).unwrap(); let input: i32 = input.trim().parse().unwrap(); let mut array = Vec::new(); for _ in 0..input { let mut input = String::new(); io::stdin().read_line(&mut input).unwrap(); let input: Vec<i32> = input.split_whitespace().map(|x| x.parse().unwrap()).collect(); array.push(input); } let mut handles = Vec::new(); let mut paths: i64 = 0; let split = split(input as usize, 4); for y in 0..4 { let array = array.clone(); let split = split.clone(); let handle = thread::spawn(move || { let mut total = 0; for i in split[y].0..split[y].1 { let mut paths = 0; for j in 0..input { paths += recurse(i as usize, j as usize, &array); } total += paths; } total }); handles.push(handle); } for handle in handles { paths += handle.join().unwrap(); } println!("{}", paths); }
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: TIME LIMIT EXCEEDED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1000000 |
user output |
---|
(empty) |
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) |