CSES - Datatähti 2024 alku - Results
Submission details
Task:Uolevin kalansaalis
Sender:ToukoP
Submission time:2023-11-05 21:21:29 +0200
Language:Rust
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED37
#2ACCEPTED63
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2details
#2ACCEPTED0.01 s1, 2details
#3ACCEPTED0.01 s1, 2details
#4ACCEPTED0.01 s1, 2details
#5ACCEPTED0.01 s1, 2details
#6ACCEPTED0.01 s1, 2details
#7ACCEPTED0.01 s1, 2details
#8ACCEPTED0.01 s1, 2details
#9ACCEPTED0.01 s1, 2details
#10ACCEPTED0.01 s1, 2details
#11ACCEPTED0.01 s1, 2details
#12ACCEPTED0.01 s1, 2details
#13ACCEPTED0.01 s1, 2details
#14ACCEPTED0.01 s1, 2details
#15ACCEPTED0.01 s1, 2details
#16ACCEPTED0.77 s2details
#17ACCEPTED0.76 s2details
#18ACCEPTED0.78 s2details
#19ACCEPTED0.74 s2details
#20ACCEPTED0.76 s2details
#21ACCEPTED0.75 s2details
#22ACCEPTED0.75 s2details
#23ACCEPTED0.74 s2details
#24ACCEPTED0.75 s2details

Code

use std::io::*;
const MAX_SIZE: usize = 600;
fn calc_limits(n: usize, m: usize, x: usize, y: usize, is_down: bool) -> usize {
let left = if x % 2 == 1 { y * 2 - 1 } else { y * 2 };
let right = if x % 2 == 0 {
(m - y + 1) * 2 - 1
} else {
(m - y + 1) * 2
};
if is_down { n - x + 1 } else { x }.min(left).min(right)
}
#[cfg(feature = "print")]
fn print_buf(n: usize, m: usize, buf: &[[i32; MAX_SIZE]; MAX_SIZE]) {
for x in 1..(n + 1) {
if x % 2 == 0 {
#[cfg(feature = "print")]
print!(" |");
} else {
#[cfg(feature = "print")]
print!("|");
};
for y in 1..(m + 1) {
print!(" {: >3} |", buf[x][y]);
}
println!("");
}
}
fn get_highscore(n: usize, m: usize, catch: &[[i32; MAX_SIZE]; MAX_SIZE], is_down: bool) -> i32 {
let mut buf1 = [[0; MAX_SIZE]; MAX_SIZE];
let mut buf2 = catch.clone();
let mut buf3 = [[0; MAX_SIZE]; MAX_SIZE];
let mut write = &mut buf1;
let mut current = &mut buf2;
let mut prev = &mut buf3;
let mut highscore = catch[1][1];
for i in 2..(n + 1) {
#[cfg(feature = "print")]
{
println!("Size: {i}, current highscore: {highscore}");
println!("Current:");
print_buf(n, m, current);
println!("Previous:");
print_buf(n, m, prev);
println!("");
}
for x in 1..(n + 1) {
let offset = if x % 2 == 0 {
#[cfg(feature = "print")]
print!(" |");
1
} else {
#[cfg(feature = "print")]
print!("|");
0
};
for y in 1..(m + 1) {
let limit = calc_limits(n, m, x, y, is_down);
if limit < i {
write[x][y] = 0;
#[cfg(feature = "print")]
print!(" --- |",);
continue;
}
let score = if is_down {
catch[x][y] + current[x + 1][y + offset - 1] + current[x + 1][y + offset]
- prev[x + 2][y]
} else {
catch[x][y] + current[x - 1][y + offset - 1] + current[x - 1][y + offset]
- prev[x - 2][y]
};
write[x][y] = score;
#[cfg(feature = "print")]
print!(" {: >3} |", score);
if score < highscore {
highscore = score;
}
}
#[cfg(feature = "print")]
println!("");
}
let swap = prev;
prev = current;
current = write;
write = swap;
#[cfg(feature = "print")]
println!("\n");
}
highscore
}
fn main() -> Result<()> {
let mut input = String::new();
stdin().read_line(&mut input)?;
let mut split = input.split(" ");
let n: usize = split.next().unwrap().trim().parse().unwrap();
let m: usize = split.next().unwrap().trim().parse().unwrap();
let k: usize = split.next().unwrap().trim().parse().unwrap();
let mut catch = [[0; MAX_SIZE]; MAX_SIZE];
let mut total_score = 0;
let mut highscore = if k >= m * n { i32::MAX } else { 0 };
for _ in 0..k {
let mut input = String::new();
stdin().read_line(&mut input)?;
let mut split = input.split(" ");
let x: usize = split.next().unwrap().trim().parse().unwrap();
let y: usize = split.next().unwrap().trim().parse().unwrap();
let score: i32 = match split.next().unwrap().trim() {
"K" => -10,
"H" => 1,
_ => 0,
};
total_score += score;
catch[x][y] = score;
if score < highscore {
highscore = score;
}
}
#[cfg(feature = "print")]
println!("Single cell highscore: {}", highscore);
let highscore = highscore
.min(get_highscore(n, m, &catch, true))
.min(get_highscore(n, m, &catch, false));
#[cfg(feature = "print")]
println!("Total score: {}, Highscore: {}", total_score, highscore);
println!("{}", total_score - highscore);
Ok(())
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
5 6 13
1 1 K
5 1 K
2 2 H
4 2 H
...

correct output
-16

user output
-16

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
5 6 7
1 5 K
4 6 K
2 4 H
2 5 H
...

correct output
0

user output
0

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
5 6 7
5 5 K
2 6 K
2 4 H
2 5 H
...

correct output
0

user output
0

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
10 10 51
3 3 H
6 3 H
9 5 H
5 10 H
...

correct output
50

user output
50

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
10 10 52
3 5 H
3 1 H
9 6 H
2 8 H
...

correct output
40

user output
40

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
10 10 60
6 10 H
2 8 H
5 8 H
8 10 H
...

correct output
-15

user output
-15

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
10 10 60
4 7 H
7 4 H
4 10 H
3 6 H
...

correct output
60

user output
60

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
10 10 40
9 9 H
5 10 H
5 6 H
4 9 H
...

correct output
2

user output
2

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
1 1 0

correct output
0

user output
0

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
1 1 1
1 1 K

correct output
0

user output
0

Test 11

Group: 1, 2

Verdict: ACCEPTED

input
1 1 1
1 1 H

correct output
0

user output
0

Test 12

Group: 1, 2

Verdict: ACCEPTED

input
10 5 32
10 3 H
4 4 H
3 3 H
5 4 H
...

correct output
20

user output
20

Test 13

Group: 1, 2

Verdict: ACCEPTED

input
5 10 32
5 9 H
2 4 H
2 9 H
2 5 H
...

correct output
28

user output
28

Test 14

Group: 1, 2

Verdict: ACCEPTED

input
10 10 100
2 9 H
5 4 H
5 9 K
6 1 K
...

correct output
-439

user output
-439

Test 15

Group: 1, 2

Verdict: ACCEPTED

input
10 10 100
8 9 H
5 10 H
5 4 H
3 9 H
...

correct output
88

user output
88

Test 16

Group: 2

Verdict: ACCEPTED

input
500 500 125000
125 261 K
84 78 K
11 200 K
481 246 K
...

correct output
-624270

user output
-624270

Test 17

Group: 2

Verdict: ACCEPTED

input
500 500 125100
16 61 H
37 62 H
459 125 H
318 476 H
...

correct output
124020

user output
124020

Test 18

Group: 2

Verdict: ACCEPTED

input
500 500 249999
22 214 H
356 145 H
341 29 H
393 262 H
...

correct output
249999

user output
249999

Test 19

Group: 2

Verdict: ACCEPTED

input
500 500 32000
30 81 H
315 34 H
78 112 H
367 166 H
...

correct output
10126

user output
10126

Test 20

Group: 2

Verdict: ACCEPTED

input
500 500 126745
164 390 H
126 331 H
164 126 H
55 92 H
...

correct output
-104692

user output
-104692

Test 21

Group: 2

Verdict: ACCEPTED

input
500 500 71200
106 191 H
314 189 H
482 485 H
344 401 H
...

correct output
-335853

user output
-335853

Test 22

Group: 2

Verdict: ACCEPTED

input
500 500 67772
421 277 H
428 470 H
169 142 H
256 345 H
...

correct output
-208567

user output
-208567

Test 23

Group: 2

Verdict: ACCEPTED

input
500 500 27434
366 481 H
38 22 H
126 107 H
135 169 H
...

correct output
-57100

user output
-57100

Test 24

Group: 2

Verdict: ACCEPTED

input
500 500 93982
183 13 H
463 230 H
264 351 H
399 290 H
...

correct output
-52800

user output
-52800