Maalaus

#include <bits/stdc++.h>

using namespace std;

// read from file instead of console:
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);

const int M = 1000000007;
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef pair<int, int> pi;
typedef queue<int> qi;
typedef stack<int> si;
typedef priority_queue<int> pqi;
typedef deque<int> dqi;
typedef unordered_set<int> seti;
typedef unordered_map<int,int> mapi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef vector<vector<vector<long long>>> vvvll;
typedef pair<long long, long long> pll;
typedef queue<long long> qll;
typedef stack<long long> sll;
typedef priority_queue<long long> pqll;
typedef deque<long long> dqll;
typedef unordered_set<long long> setll;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rloop(i, a, b) for (int i = a; i > b; i--)
#define each(a, c) for (auto a : c)
#define all(x) x.begin(), x.end()
#define PI M_PI
#define PB push_back
#define P push
#define POB pop_back
#define F first
#define S second
#define sz size()
#define R1(a) int a; cin >> a
#define R2(a, b) int a,b; cin >> a >> b
#define R3(a, b, c) int a,b,c; cin >> a >> b >> c
#define R4(a, b, c, d) int a,b,c,d; cin >> a >> b >> c >> d
#define WS(a) cout << a << " "
#define WN(a) cout << a << "\n"
#define WNL cout << "\n"

int n,m,k,q;

// bool isColumn, {i, väri}
pair<bool, pair<int,int>> ops[202020];
ll r[202020];
seti rows;
seti cols;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    // n = rivien määrä
    // m = sarakkeiden määrä
    cin >> n >> m >> k >> q;
    loop(j,0,q){
      char tp;
      cin >> tp;
      R2(i,c);
      ops[j] = {(tp == 'C'), {i,c}};
    }

    rloop(j,q-1,-1){
      bool iscol = ops[j].F;
      int color = ops[j].S.S;
      int i = ops[j].S.F;
      if(iscol){
        if(cols.count(i)) continue;
        cols.insert(i);
        r[color] += (n-rows.size());
      }else{
        if(rows.count(i)) continue;
        rows.insert(i);
        r[color] += (m-cols.size());
      }
    }
    loop(i,1,k+1){
      cout << r[i] << " ";
    }
    return 0;
}

Test 1 (public)

Group: 1, 3, 4

Verdict: ACCEPTED

Test 2 (public)

Group: 3, 4

Verdict: ACCEPTED

Test 3

Group: 1, 3, 4

Verdict: ACCEPTED

Test 4

Group: 2, 4

Verdict: ACCEPTED

Test 5

Group: 2, 4

Verdict: ACCEPTED

Test 6

Group: 3, 4

Verdict: ACCEPTED

Test 7

Group: 3, 4

Verdict: ACCEPTED

Test 8

Group: 4

Verdict: ACCEPTED

Test 9

Group: 4

Verdict: ACCEPTED

Test 10

Group: 1, 3, 4

Verdict: ACCEPTED

Test 11

Group: 1, 3, 4

Verdict: ACCEPTED

Test 12

Group: 2, 4

Verdict: ACCEPTED

Test 13

Group: 2, 4

Verdict: ACCEPTED

Test 14

Group: 4

Verdict: ACCEPTED

Test 15

Group: 4

Verdict: ACCEPTED

Test 16

Group: 4

Verdict: ACCEPTED

Test 17

Group: 4

Verdict: ACCEPTED