Submission details
Task:Maalaus
Sender:Lelleri
Submission time:2025-10-28 17:31:14 +0200
Language:C++ (C++11)
Status:READY
Result:42
Feedback
groupverdictscore
#1ACCEPTED10
#20
#3ACCEPTED32
#40
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 3, 4details
#2ACCEPTED0.00 s3, 4details
#3ACCEPTED0.00 s1, 3, 4details
#4--2, 4details
#5--2, 4details
#6ACCEPTED0.06 s3, 4details
#7ACCEPTED0.04 s3, 4details
#8--4details
#9--4details
#10ACCEPTED0.00 s1, 3, 4details
#11ACCEPTED0.00 s1, 3, 4details
#12ACCEPTED0.23 s2, 4details
#13ACCEPTED0.23 s2, 4details
#14--4details
#15--4details
#16--4details
#17--4details

Code

#include <bits/stdc++.h>
using namespace std;

int main() {
   
    int n, m, k, q;
    cin >> n >> m >> k >> q;
   
    map<int, pair<int, int>> row_colors;
    map<int, pair<int, int>> column_colors;
   
    for (int i=0; i < q; i++){
        char type;
        int ind;
        int color;
        cin >> type >> ind >> color;
        if(type == 'R'){
            row_colors[ind] = {color, i};
        }
        if(type == 'C'){
            column_colors[ind] = {color, i};
        }
    }


    set<int> row_indexes;
    for(auto row_info : row_colors){
        row_indexes.insert(row_info.second.second);
    }
    
    set<int> col_indexes;
    for(auto col_info : column_colors){
        col_indexes.insert(col_info.second.second);
    }

    vector<long long> result;
    for(int color=1; color <= k; color++){
        long long colored_squares = 0;
        // Check each row for this color
        for(auto row_info : row_colors){
            // This row is right color
            if(row_info.second.first == color){
                auto pos = distance(col_indexes.begin(), col_indexes.lower_bound(row_info.second.second));
                colored_squares += m-(col_indexes.size()-pos);
            }
        }
        
        // Check each column for this color
        for(auto column_info : column_colors){
            // This column is right color
            if(column_info.second.first == color){
                auto pos = distance(row_indexes.begin(), row_indexes.lower_bound(column_info.second.second));
                
                colored_squares += n-(row_indexes.size()-pos);
            }
            
        }

        result.push_back(colored_squares);
    }
    
    for(int i=0; i < k; i++){
        cout << result[i] << " ";
    }
    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:

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

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

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)