Maalaus

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

using ll = long long;
#define all(v) begin(v), end(v)



void solve() {
    // go in reverse
    // if this row already done -> 0 increase
    // otherwise increase is width -number of colums done?
    set<ll> rows, cols;
    map<ll, ll> ans;
    ll n, m, k, q;
    cin >> n >> m >> k >> q;
    for (ll i=1; i<=k; i++) ans[i] = 0;
    vector<array<ll, 3>> ops;
    for (ll z=0; z<q; z++) {
        char op;
        ll i, c;
        cin >> op;
        cin >> i >> c;
        if (op=='R') op = 0;
        else op = 1;
        ops.push_back({op, i, c});
    }
    reverse(all(ops));
    for (auto [op, i, c]: ops) {
        if (op==0) {
            if (rows.count(i)) continue;
            ans[c] += m-cols.size();
            rows.insert(i);
        } else {
            if (cols.count(i)) continue;
            ans[c] += n-rows.size();
            cols.insert(i);
        }
    }
    for (auto [c, f]: ans) {
        cout << f << ' ';
    }
    cout << '\n';
}


int main() {
    cin.tie(0)->sync_with_stdio(0);
    int tc=1;
    // cin >> tc;
    while (tc--) solve();
}

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