Submission details
Task:Maalaus
Sender:Lytsky
Submission time:2025-10-28 10:06:03 +0200
Language:C++ (C++11)
Status:READY
Result:16
Feedback
groupverdictscore
#10
#2ACCEPTED16
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 3, 4details
#2ACCEPTED0.00 s3, 4details
#3ACCEPTED0.00 s1, 3, 4details
#4ACCEPTED0.41 s2, 4details
#5ACCEPTED0.32 s2, 4details
#6ACCEPTED0.01 s3, 4details
#70.01 s3, 4details
#80.64 s4details
#90.49 s4details
#10ACCEPTED0.00 s1, 3, 4details
#110.00 s1, 3, 4details
#12ACCEPTED0.24 s2, 4details
#13ACCEPTED0.23 s2, 4details
#14ACCEPTED0.44 s4details
#15ACCEPTED0.33 s4details
#16ACCEPTED0.48 s4details
#17ACCEPTED0.37 s4details

Code

#include <bits/stdc++.h>

using namespace std;

//Lähe uusimmasta lähtien, niin saat oikeet värit
int main() {
    int n, m, d_colors, operations;
    cin >> n >> m >> d_colors >> operations;
    map<int, pair<int, int>> column_colors, row_colors;
    map<int, long long> colors;
    set<pair<int, int>> rows, columns;

    for (int index = 0; index < operations; index++) {
        char r_c;
        int th, color;
        cin >> r_c >> th >> color;
        if (r_c == 'R') {
            row_colors[th-1] = {index, color-1};
        }
        else {
            column_colors[th-1] = {index, color-1};
        }
    }
    for (auto row : row_colors) { 
        rows.insert(row.second);
    }
    for (auto column : column_colors) { 
        columns.insert(column.second);
    }
    while ((int) rows.size() > 0) {
        while ((int) columns.size() > 0 && *(rows.begin()) > *(columns.begin())) {
            colors[(*(columns.begin())).second] += (long long) (n - rows.size());
            columns.erase(columns.begin());
        }
        colors[(*(rows.begin())).second] += (long long) (m - columns.size());
        rows.erase(rows.begin());
    }
    while ((int) columns.size() > 0) {
        colors[(*(columns.begin())).second] += (long long) (n - rows.size());
        columns.erase(columns.begin());
    }

    for (int index = 0; index < (int) colors.size(); index++) { 
        if (colors[index]) cout << colors[index] << " ";
        else cout << 0 << " "; 
    }
    cout << endl; 

    /*for (auto row : rows) { 
      for (auto column : columns) { 
      if (column_colors[column].second > row_colors[row].second) colors_amounts[column_colors[column].first]++;
      else if (column_colors[column].second < row_colors[row].second) colors_amounts[row_colors[row].first]++;
      }
      }
      for (auto row : rows) { 
      colors_amounts[row_colors[row].first] += (long long int) (m - columns.size());
      }
      for (auto column : columns) { 
      colors_amounts[column_colors[column].first] += (long long int) (n - rows.size());
      }
      for (int index = 0; index < (int) colors_amounts.size(); index++) { 
      cout << (long long int) colors_amounts[index] << " ";
      }
      cout << endl; */
}

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:

input
1000000000 1000000000 2000 200...

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

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

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
0 0 999997829 0 1999872519 199...

Feedback: Output is shorter than expected

Test 9

Group: 4

Verdict:

input
1000000000 1000000000 200000 2...

correct output
999986843 0 0 999966411 999971...

user output
999986843 0 0 999966411 999971...

Feedback: Output is shorter than expected

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:

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 

Feedback: Output is shorter than expected

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