Submission details
Task:Maalaus
Sender:rottis
Submission time:2025-10-29 12:58:26 +0200
Language:C++ (C++17)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED10
#2ACCEPTED16
#3ACCEPTED32
#4ACCEPTED42
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 3, 4details
#2ACCEPTED0.01 s3, 4details
#3ACCEPTED0.01 s1, 3, 4details
#4ACCEPTED0.22 s2, 4details
#5ACCEPTED0.18 s2, 4details
#6ACCEPTED0.01 s3, 4details
#7ACCEPTED0.01 s3, 4details
#8ACCEPTED0.26 s4details
#9ACCEPTED0.24 s4details
#10ACCEPTED0.01 s1, 3, 4details
#11ACCEPTED0.01 s1, 3, 4details
#12ACCEPTED0.14 s2, 4details
#13ACCEPTED0.14 s2, 4details
#14ACCEPTED0.22 s4details
#15ACCEPTED0.19 s4details
#16ACCEPTED0.23 s4details
#17ACCEPTED0.21 s4details

Compiler report

input/code.cpp: In function 'void print_colors(ulonglong*, uint)':
input/code.cpp:21:23: warning: comparison of integer expressions of different signedness: 'int' and 'uint' {aka 'unsigned int'} [-Wsign-compare]
   21 |     for (int i = 0; i < color_count; i++) {
      |                     ~~^~~~~~~~~~~~~

Code

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



const int MAX_INPUT = 200000;

typedef unsigned long long ulonglong;

typedef unsigned long ulong;

typedef unsigned int uint;

typedef struct Operation {
    char rowtype;
    uint color;
} Operation;

void print_colors(ulonglong color_sums[], uint color_count) {
    for (int i = 0; i < color_count; i++) {
        std::cout << color_sums[i] << ' ';
    }
    std::cout << '\n';
}


int main() {
    ulong height, width;
    uint color_count, operation_count;

    Operation operations[MAX_INPUT];

    uint operation_index = 0;

    char rowtypes[MAX_INPUT];
    ulong indices[MAX_INPUT];
    uint colors[MAX_INPUT];

    std::unordered_set<ulong> seen_row_indices;
    std::unordered_set<ulong> seen_col_indices;

    uint modified_row_count = 0;
    uint modified_col_count = 0;

    std::cin >> height >> width >> color_count >> operation_count;

    for (uint i = 0; i < operation_count; i++) {
        char rowtype;
        ulong index;
        uint color;
        std::cin >> rowtype >> index >> color;

        rowtypes[i] = rowtype;
        indices[i] = index;
        colors[i] = color;
    }

    for (int i = operation_count - 1; i >= 0; i--) {
        char rowtype = rowtypes[i];
        ulong index = indices[i];
        uint color = colors[i] - 1; // convert 1-20000 to 0-19999

        bool was_inserted;
        if (rowtype == 'R') {
            was_inserted = seen_row_indices.insert(index).second;
            if (was_inserted) { modified_row_count++; }
        } else {
            was_inserted = seen_col_indices.insert(index).second;
            if (was_inserted) { modified_col_count++; }
        }

        if (was_inserted) {
            Operation operation;
            operation.rowtype = rowtype;
            operation.color = color;
            operations[operation_index++] = operation;
        }
    }
    
    ulong unaffected_rows = height - modified_row_count;
    ulong unaffected_cols = width - modified_col_count;

    ulonglong color_sums[MAX_INPUT];

    for (uint i = 0; i < modified_row_count + modified_col_count; i++) {
        Operation operation = operations[i];
        if (operation.rowtype == 'R') {
            color_sums[operation.color] += unaffected_cols;
        } else {
            color_sums[operation.color] += unaffected_rows;
        }
    }
    //print_colors(color_sums, color_count);

    ulong current_row_width = modified_col_count;
    ulong current_col_width = modified_row_count;

    for (uint i = 0; i < modified_row_count + modified_col_count - 1; i++) {
        Operation operation = operations[i];
        if (operation.rowtype == 'R') {
            current_col_width--;
            color_sums[operation.color] += current_row_width;
            //std::cout << "Added " << current_row_width << " to " << operation.color << std::endl;
        } else {
            current_row_width--;
            color_sums[operation.color] += current_col_width;
            //std::cout << "Added " << current_col_width << " to " << operation.color << std::endl;
        }
    }

    for (uint i = 0; i < color_count; i++) {
        std::cout << color_sums[i] << ' ';
    }
    std::cout << '\n';

    return 0;
}

Test details

Test 1 (public)

Group: 1, 3, 4

Verdict: ACCEPTED

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 1 

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: ACCEPTED

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 13 0 8 7 20 0 0 10 7 

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: ACCEPTED

input
1000000000 1000000000 2000 200...

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

user output
999999481 0 999999445 0 0 0 0 ...

Test 8

Group: 4

Verdict: ACCEPTED

input
1000000000 1000000000 200000 2...

correct output
0 0 999997829 0 1999872519 199...

user output
0 0 999997829 0 1999872519 199...

Test 9

Group: 4

Verdict: ACCEPTED

input
1000000000 1000000000 200000 2...

correct output
999986843 0 0 999966411 999971...

user output
999986843 0 0 999966411 999971...

Test 10

Group: 1, 3, 4

Verdict: ACCEPTED

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
1 0 0 0 0 0 0 9 0 0 

Test 11

Group: 1, 3, 4

Verdict: ACCEPTED

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
0 0 0 0 0 0 0 10 0 0 

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: ACCEPTED

input
1000000000 1000000000 100 2000...

correct output
2003899199298 2016897879262 20...

user output
2003899199298 2016897879262 20...

Test 15

Group: 4

Verdict: ACCEPTED

input
1000000000 1000000000 100 2000...

correct output
1267960483393 1326958437362 12...

user output
1267960483393 1326958437362 12...

Test 16

Group: 4

Verdict: ACCEPTED

input
1000000000 1000000000 10000 20...

correct output
26998778013 13999380552 239989...

user output
26998778013 13999380552 239989...

Test 17

Group: 4

Verdict: ACCEPTED

input
1000000000 1000000000 10000 20...

correct output
7999699356 8999760379 12999665...

user output
7999699356 8999760379 12999665...