Submission details
Task:Maalaus
Sender:rottis
Submission time:2025-10-28 00:01:04 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#10.00 s1, 3, 4details
#20.00 s3, 4details
#30.00 s1, 3, 4details
#40.02 s2, 4details
#50.02 s2, 4details
#60.01 s3, 4details
#70.01 s3, 4details
#80.02 s4details
#90.02 s4details
#100.01 s1, 3, 4details
#110.00 s1, 3, 4details
#120.02 s2, 4details
#130.02 s2, 4details
#140.02 s4details
#150.02 s4details
#160.02 s4details
#170.03 s4details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:74:15: warning: unused variable 'idx' [-Wunused-variable]
   74 |         ulong idx = indices[i];
      |               ^~~

Code

#include <iostream>
#include <vector>
#include <unordered_set>

enum RowType {
    ROW,
    COL
};

typedef unsigned long ulong;

typedef struct Operation {
    long idx;
    long time;
    long color;
} Operation;

/*
void print_op(std::vector<Operation> arr) {
    for (Operation cur : arr) {
        //std::cout << cur.idx << ' ' << cur.time << ' ' << cur.color << std::endl;
    }
}

void print_colors(ulong* colors, long size) {
    for (long i = 0; i < size; i++) {
        //std::cout << colors[i] << ' ';
    }
    //std::cout << std::endl;
}*/

ulong hgt, wid, color_count, operation_count;

int main() {
    long time = 0;
    std::vector<Operation> row_operations;
    std::vector<Operation> col_operations;

    ulong next_row_index = 0;
    ulong next_col_index = 0;
    std::unordered_set<ulong> existing_rows;
    std::unordered_set<ulong> existing_cols;

    std::cin >> hgt >> wid >> color_count >> operation_count;
    
    existing_rows.reserve(operation_count);
    existing_cols.reserve(operation_count);

    row_operations.reserve(operation_count);
    col_operations.reserve(operation_count);

    char rows[20001];
    ulong indices[20001];
    ulong colors[20001];
    /*std::cout << "before: " << std::endl;
    print_colors(colors, operation_count);*/
    for (ulong i = 0; i < operation_count; i++) {
        char c;
        ulong idx, color;
        
        std::cin >> c >> idx >> color;
        
        rows[i] = c;
        indices[i] = idx;
        colors[i] = color - 1;
    }
    /*std::cout << "after: " << std::endl;
    print_colors(colors, operation_count);
    std::cout << std::endl;*/

    char last_row = 'Z';
    for (long i = operation_count - 1; i >= 0; i--) {
        char row = rows[i];
        ulong idx = indices[i];
        long color = colors[i];
        //std::cout << "row: " << row << ", idx: " << idx << ", color: " << color << std::endl;

        if (row != last_row) { time++; }

        if (row == 'R') {
            if (/*existing_rows.count(idx) == 0*/true) {
                //existing_rows.insert(idx);
                long translated_row = next_row_index++;
                //std::cout << "next_row_index: " << next_row_index << std::endl;
                row_operations.push_back({
                    translated_row, time, color
                });
            }

        } else {
            if (/*existing_cols.count(idx) == 0*/true) {
                //existing_cols.insert(idx);
                long translated_col = next_col_index++;
                //std::cout << "next_col_index: " << next_col_index << std::endl;
                col_operations.push_back({
                    translated_col, time, color
                });
            }
        }

        last_row = row;
    }

    //print_op(row_operations);
    //print_op(col_operations);

    std::cout << "intentionally wrong answer" << std::endl;
    return 0;
    long rows_left_unmodified = hgt - next_row_index;
    //std::cout << "hgt: " << hgt << ", next_row_index: " << next_row_index << ", rows left unmodified: " << rows_left_unmodified << std::endl;
    long cols_left_unmodified = wid - next_col_index;
    //std::cout << "wid: " << wid << ", next_col_index: " << next_col_index << ", cols left unmodified: " << cols_left_unmodified << std::endl;

    ulong colors_sum[20001];
    for (long i = 0; i < 20000; i++) {
        colors_sum[i] = 0;
    }

    for (Operation operation: row_operations) {
        colors_sum[operation.color] += cols_left_unmodified;
    }

    for (Operation operation: col_operations) {
        colors_sum[operation.color] += rows_left_unmodified;
    }

    // Exceptions:
    // - no operations are defined
    // - only rows are given
    // - only cols are given
    // Ignore if exception moment
    if (next_col_index && next_row_index) {
        time = 0;
        RowType cur_type;
        long row_index = 0;
        long row_length = next_row_index - 1;
        long col_index = 0;
        long col_length = next_col_index - 1;

        if (row_operations[0].time < col_operations[0].time) {
            time = row_operations[row_index].time;
            cur_type = RowType::ROW;
        } else {
            time = col_operations[col_index].time;
            cur_type = RowType::COL;
        }

        while (row_length >= 0 && col_length >= 0) {
            if (cur_type == RowType::ROW) {
                Operation row = row_operations[row_index];
                //std::cout << "ROW " << row_index << ", color: " << row.color << ", time: " << time << ", rowtime: " << row.time << std::endl;
                
                if (time < row.time) { time++; cur_type = RowType::COL; continue; }

                //std::cout << "Add " << col_length + 1 << " to " << row.color << std::endl;
                colors_sum[row.color] += col_length + 1;
                
                row_index++;
                row_length--;
            } else {
                Operation col = col_operations[col_index];
                //std::cout << "COL " << col_index << ", color: " << col.color << ", time: " << time << ", rowtime: " << col.time << std::endl;
                
                if (time < col.time) { time++; cur_type = RowType::ROW; continue; }

                //std::cout << "Add " << row_length + 1 << " to " << col.color << std::endl;
                colors_sum[col.color] += row_length + 1;
                
                col_index++;
                col_length--;
            }
        }
    }
    

    // print
    for (ulong i = 0; i < color_count; i++) {
        std::cout << colors_sum[i] << ' ';
    }
    std::cout.flush();

    return 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
intentionally wrong answer

Feedback: Output is shorter than expected

Test 2 (public)

Group: 3, 4

Verdict:

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

correct output
3999999991 1999999998 19999999...

user output
intentionally wrong answer

Feedback: Output is shorter than expected

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
intentionally wrong answer

Feedback: Output is shorter than expected

Test 4

Group: 2, 4

Verdict:

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

correct output
199984000629575

user output
(empty)

Test 5

Group: 2, 4

Verdict:

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

correct output
126261014543986

user output
(empty)

Test 6

Group: 3, 4

Verdict:

input
1000000000 1000000000 2000 200...

correct output
999999400 2999997760 999999118...

user output
intentionally wrong answer

Feedback: Output is shorter than expected

Test 7

Group: 3, 4

Verdict:

input
1000000000 1000000000 2000 200...

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

user output
intentionally wrong answer

Feedback: Output is shorter than expected

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
intentionally wrong answer

Feedback: Output is shorter than expected

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
intentionally wrong answer

Feedback: Output is shorter than expected

Test 12

Group: 2, 4

Verdict:

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

correct output
1000000000

user output
(empty)

Test 13

Group: 2, 4

Verdict:

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

correct output
1000000000

user output
(empty)

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)