Maalaus

#include <iostream>
#include <vector>
#include <set>

using namespace std;

// Structure to store operation details
struct Operation {
    char type;
    int index;
    int color;
};

int main() {
    // Optimize I/O operations for speed
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    long long n, m;
    int k, q;
    
    if (!(cin >> n >> m >> k >> q)) return 0;

    vector<Operation> ops(q);
    for (int i = 0; i < q; ++i) {
        cin >> ops[i].type >> ops[i].index >> ops[i].color;
    }

    // Sets to keep track of rows and columns processed from the end
    set<int> seen_rows;
    set<int> seen_cols;
    
    // Array to store the answer for each color. 
    // Using long long because the total area can exceed 2^31.
    // Size is k + 1 because colors are 1-indexed.
    vector<long long> color_counts(k + 1, 0);

    // Process operations in reverse order
    for (int i = q - 1; i >= 0; --i) {
        char type = ops[i].type;
        int idx = ops[i].index;
        int color = ops[i].color;

        if (type == 'R') {
            // If this row hasn't been painted by a "later" operation
            if (seen_rows.find(idx) == seen_rows.end()) {
                // The number of squares this row operation successfully paints
                // is the total width (m) minus any columns "locked" by later column ops.
                long long count = m - seen_cols.size();
                color_counts[color] += count;
                seen_rows.insert(idx);
            }
        } else { // type == 'C'
            // If this column hasn't been painted by a "later" operation
            if (seen_cols.find(idx) == seen_cols.end()) {
                // The number of squares this column operation successfully paints
                // is the total height (n) minus any rows "locked" by later row ops.
                long long count = n - seen_rows.size();
                color_counts[color] += count;
                seen_cols.insert(idx);
            }
        }
    }

    // Output results for colors 1 to k
    for (int i = 1; i <= k; ++i) {
        cout << color_counts[i] << (i == k ? "" : " ");
    }
    cout << endl;

    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