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

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:44:27: warning: 'setColumns' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |                 setColumns++;
      |                 ~~~~~~~~~~^~
input/code.cpp:37:24: warning: 'setRows' may be used uninitialized in this function [-Wmaybe-uninitialized]
   37 |                 setRows++;
      |                 ~~~~~~~^~

Code

#include <iostream>
#include <vector>
#include <string>
#include <unordered_map>

using namespace std;

int main(){
    int n,m,k,q;
    cin>>n>>m>>k>>q;
    vector<bool> directions(q, 0);
    vector<int> indexes(q, 0);
    vector<int> colors(q, 0);
    vector<long long> numOfColors(k, 0);
    unordered_map<int, bool> rows;
    unordered_map<int, bool> columns;
    int setRows, setColumns;
    for (int i=0;i<q;i++){
        int color, index;
        string s;
        cin>>s>>index>>color;
        if (s=="R"){
            directions[i]=0;
        }
        else{
            directions[i]=1;
        }
        indexes[i]=index;
        colors[i]=color-1;
    }

    for (int i=q-1;i>=0;i--){
        if (directions[i]==0){
            if (rows.find(indexes[i])==rows.end()){
                numOfColors[colors[i]]+=m-setColumns;
                rows[indexes[i]]=1;
                setRows++;
            }
        }
        if (directions[i]==1){
            if (columns.find(indexes[i])==columns.end()){
                numOfColors[colors[i]]+=n-setRows;
                columns[indexes[i]]=1;
                setColumns++;
            }
        }
    }
    for (int i=0;i<k; i++){
        cout<<numOfColors[i]<<"\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
1999999999
999999994
999999994

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

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
999999745
1999999641
...

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

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

Test 9

Group: 4

Verdict: ACCEPTED

input
1000000000 1000000000 200000 2...

correct output
999986843 0 0 999966411 999971...

user output
999986843
0
0
999966411
999971774
...

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

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

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
2023895998898
2027897126864
2049897770031
...

Test 15

Group: 4

Verdict: ACCEPTED

input
1000000000 1000000000 100 2000...

correct output
1267960483393 1326958437362 12...

user output
1267960483393
1326958437362
1282959740036
1284959767254
1276959856528
...

Test 16

Group: 4

Verdict: ACCEPTED

input
1000000000 1000000000 10000 20...

correct output
26998778013 13999380552 239989...

user output
26998778013
13999380552
23998918414
17998990208
15999444847
...

Test 17

Group: 4

Verdict: ACCEPTED

input
1000000000 1000000000 10000 20...

correct output
7999699356 8999760379 12999665...

user output
7999699356
8999760379
12999665860
9999570154
11999668957
...