Submission details
Task:Maalaus
Sender:ma100
Submission time:2025-10-30 21:50:33 +0200
Language:Rust (2021)
Status:READY
Result:16
Feedback
groupverdictscore
#10
#2ACCEPTED16
#30
#40
Test results
testverdicttimegroup
#10.00 s1, 3, 4details
#2ACCEPTED0.00 s3, 4details
#30.00 s1, 3, 4details
#4ACCEPTED0.04 s2, 4details
#5ACCEPTED0.05 s2, 4details
#6ACCEPTED0.01 s3, 4details
#70.01 s3, 4details
#8--4details
#9--4details
#100.00 s1, 3, 4details
#110.00 s1, 3, 4details
#12ACCEPTED0.04 s2, 4details
#13ACCEPTED0.04 s2, 4details
#14--4details
#15--4details
#16--4details
#17--4details

Code

use std::collections::HashMap;
use std::io;

fn read_next<'a, I>(iter: &mut I) -> u32
where
    I: Iterator<Item = &'a str>,
{
    iter.next()
        .expect("invalid input")
        .parse::<u32>()
        .expect("invalid integer")
}

fn main() {
    // Input
    let mut nmkq = String::new();
    io::stdin()
        .read_line(&mut nmkq)
        .expect("failed to read line");
    let mut nmkq = nmkq.split_ascii_whitespace();
    let n = read_next(&mut nmkq);
    let m = read_next(&mut nmkq);
    let k = read_next(&mut nmkq);
    let q = read_next(&mut nmkq);

    let mut row_ops: HashMap<u32, (u32, u32)> = HashMap::new(); // row: (color, left)
    let mut col_ops: HashMap<u32, (u32, u32)> = HashMap::new();
    let mut sums: Vec<u128> = vec![0; k as usize];

    for _ in 0..q {
        let mut oic = String::new();
        io::stdin()
            .read_line(&mut oic)
            .expect("failed to read line");
        let mut oic = oic.split_ascii_whitespace();
        let o = oic.next().expect("too few arguments");
        let i = read_next(&mut oic) - 1;
        let c = read_next(&mut oic) - 1;
        if k > 1 {
            match o {
                "R" => {
                    let was_painted = row_ops.insert(i, (c, m));
                    let same_color: bool; // Prevents an edge case
                    match was_painted {
                        Some((color, left)) => {
                            same_color = color == c;
                            sums[color as usize] = sums[color as usize].checked_sub(left as u128).expect("msg");
                        }
                        None => {
                            same_color = false;
                        }
                    }
                    if !same_color {
                        for (_, (color, left)) in col_ops.iter_mut() {
                            sums[*color as usize] = sums[*color as usize].checked_sub(1).expect("msg");
                            *left = (*left).checked_sub(1).expect("msg");
                        }
                    }
                    sums[c as usize] = sums[c as usize].checked_add(m as u128).expect("msg");
                }
                "C" => {
                    let was_painted = col_ops.insert(i, (c, n));
                    let same_color: bool;
                    match was_painted {
                        Some((color, left)) => {
                            same_color = color == c;
                            sums[color as usize] = sums[color as usize].checked_sub(left as u128).expect("msg");
                        }
                        None => {
                            same_color = false;
                        }
                    }
                    if !same_color {
                        for (_, (color, left)) in row_ops.iter_mut() {
                            sums[*color as usize] = sums[*color as usize].checked_sub(1).expect("msg");
                            *left = (*left).checked_sub(1).expect("msg");
                        }
                    }
                sums[c as usize] = sums[c as usize].checked_add(n as u128).expect("msg");
                }
                _ => panic!("illegal operation '{o}'"),
            };
        } else {
            // special case k=1
            match o {
                "R" => {
                    // Loss is impossible
                    if row_ops.insert(i, (0, 0)).is_none() {
                        sums[0] = sums[0].checked_add((m as usize - col_ops.len()) as u128).expect("msg");
                    }
                }
                "C" => {
                    if col_ops.insert(i, (0, 0)).is_none() {
                        sums[0] = sums[0].checked_add((n as usize - row_ops.len()) as u128).expect("msg");
                    }
                }
                _ => panic!("illegal operation '{o}'"),
            };
        }
    }

    if k > 1 {
        for value in sums {
            print!("{value} ")
        }
        println!();
    } else {
        println!("{}", sums[0]);
    }
}

Test details

Test 1 (public)

Group: 1, 3, 4

Verdict:

input
3 4 4 4
R 1 1
C 3 4
R 2 2
R 1 1

correct output
4 4 0 1

user output
4 4 0 2 

Feedback: Incorrect character on line 1 col 7: expected "1", got "2"

Test 2 (public)

Group: 3, 4

Verdict: ACCEPTED

input
1000000000 1000000000 5 10
C 70724881 4
C 290904744 1
C 569311326 5
R 896293092 1
...

correct output
3999999991 1999999998 19999999...

user output
3999999991 1999999998 19999999...

Test 3

Group: 1, 3, 4

Verdict:

input
10 10 10 10
R 10 8
C 1 2
R 10 2
R 1 4
...

correct output
0 13 0 8 7 20 0 0 10 7

user output
0 12 0 8 7 20 0 0 10 7 

Feedback: Incorrect character on line 1 col 4: expected "13", got "12"

Test 4

Group: 2, 4

Verdict: ACCEPTED

input
1000000000 1000000000 1 200000
R 185082082 1
C 549662476 1
R 484749097 1
R 330334821 1
...

correct output
199984000629575

user output
199984000629575

Test 5

Group: 2, 4

Verdict: ACCEPTED

input
1000000000 1000000000 1 200000
C 354072394 1
C 221236382 1
C 63527838 1
C 538599654 1
...

correct output
126261014543986

user output
126261014543986

Test 6

Group: 3, 4

Verdict: ACCEPTED

input
1000000000 1000000000 2000 200...

correct output
999999400 2999997760 999999118...

user output
999999400 2999997760 999999118...

Test 7

Group: 3, 4

Verdict:

input
1000000000 1000000000 2000 200...

correct output
999999481 0 999999445 0 0 0 0 ...

user output
999999276 0 999999212 0 0 0 0 ...

Feedback: Incorrect character on line 1 col 7: expected "999999481", got "999999276"

Test 8

Group: 4

Verdict:

input
1000000000 1000000000 200000 2...

correct output
0 0 999997829 0 1999872519 199...

user output
(empty)

Test 9

Group: 4

Verdict:

input
1000000000 1000000000 200000 2...

correct output
999986843 0 0 999966411 999971...

user output
(empty)

Test 10

Group: 1, 3, 4

Verdict:

input
1 10 10 10
C 1 10
R 1 4
C 9 3
R 1 7
...

correct output
1 0 0 0 0 0 0 9 0 0

user output
(empty)

Error:
thread 'main' panicked at input/code.rs:55:90:
msg
note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace

Test 11

Group: 1, 3, 4

Verdict:

input
10 1 10 10
R 4 6
R 5 1
R 4 2
R 3 9
...

correct output
0 0 0 0 0 0 0 10 0 0

user output
(empty)

Error:
thread 'main' panicked at input/code.rs:75:90:
msg
note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace

Test 12

Group: 2, 4

Verdict: ACCEPTED

input
1 1000000000 1 200000
C 298761159 1
R 1 1
C 831911362 1
C 25171734 1
...

correct output
1000000000

user output
1000000000

Test 13

Group: 2, 4

Verdict: ACCEPTED

input
1000000000 1 1 200000
R 68306849 1
C 1 1
C 1 1
R 485427101 1
...

correct output
1000000000

user output
1000000000

Test 14

Group: 4

Verdict:

input
1000000000 1000000000 100 2000...

correct output
2003899199298 2016897879262 20...

user output
(empty)

Test 15

Group: 4

Verdict:

input
1000000000 1000000000 100 2000...

correct output
1267960483393 1326958437362 12...

user output
(empty)

Test 16

Group: 4

Verdict:

input
1000000000 1000000000 10000 20...

correct output
26998778013 13999380552 239989...

user output
(empty)

Test 17

Group: 4

Verdict:

input
1000000000 1000000000 10000 20...

correct output
7999699356 8999760379 12999665...

user output
(empty)