Maalaus

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <chrono>
#include <iomanip>
#include <unordered_map>

typedef long long ll;
using namespace std;

struct row
{
    int color = 0;
    int x = -1;
    int y = -1;
};

int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int height, width, colorAmount, operationAmount;

    cin >> height >> width >> colorAmount >> operationAmount;

    //auto start = chrono::high_resolution_clock::now();

    vector<row> rivit;

    int columnAmount = 0;
    int rowAmount = 0;

    vector<ll> colorResults(colorAmount + 1);

    for (int i = 0; i < operationAmount; i++)
    {
        string operation;
        int location, color;
        cin >> operation >> location >> color;
        location--;

        if (operation == "R")
        {

            row rivi;
            rivi.color = color;
            rivi.y = location;
            rivit.push_back(rivi);

            rowAmount++;
        }
        if (operation == "C")
        {
            row sarake;
            sarake.color = color;
            sarake.x = location;
            rivit.push_back(sarake);

            columnAmount++;
        }
    }

    // make new vector that has no duplicates:

    unordered_map<int, bool> seenColumn;
    unordered_map<int, bool> seenRow;

    vector<row> rivitNoDupes;

    // loop all operations from the latest one to the first one,
    // making sure operations under newer operations wont get added

    for (int i = operationAmount - 1; i >= 0; i--)
    {
        if (rivit[i].x == -1)
        { // jos on rivi
            if(!seenRow[rivit[i].y]){
                seenRow[rivit[i].y] = true;
                rivitNoDupes.push_back(rivit[i]);
            }
            else{
                rowAmount--;
            }
        }
        if (rivit[i].y == -1)
        { // jos on sarake
            if(!seenColumn[rivit[i].x]){
                seenColumn[rivit[i].x] = true;
                rivitNoDupes.push_back(rivit[i]);
            }
            else{
                columnAmount--;
            }
        }
    }

    int currentRowsUnder = 0;
    int currentColumsUnder = 0;

    // lasku
    // muista että rivitNoDupes ensimmäinen on päällimmäisin, joten aloita viimeisestä.
    for (int i = rivitNoDupes.size()-1; i >= 0; i--)
    {
        if (rivitNoDupes[i].x == -1)
        {
            //cout << currentColumsUnder << " rivi " << rivitNoDupes[i].y << "\n";
            //  lisätään kaikki rivit, miinustetaan kaikki täydet poikkirivit ja lisätään takaisin ne kohdat joissa tämä rivi on poikkirivin yläpuolella
            colorResults[rivitNoDupes[i].color] += width - columnAmount + currentColumsUnder;

            currentRowsUnder++;
        }
        if (rivitNoDupes[i].y == -1)
        {
            //cout << currentRowsUnder << " sarake " << rivitNoDupes[i].x << "\n";
            //  lisätään kaikki rivit, miinustetaan kaikki täydet poikkirivit ja lisätään takaisin ne kohdat joissa tämä rivi on poikkirivin yläpuolella
            colorResults[rivitNoDupes[i].color] += height - rowAmount + currentRowsUnder;

            currentColumsUnder++;
        }
    }

    for (int i = 1; i <= colorAmount; i++)
    {
        cout << colorResults[i] << " ";
    }

    //auto stop = chrono::high_resolution_clock::now();

    //auto duration = chrono::duration_cast<chrono::microseconds>(stop - start);
    //cout << endl
    //     << duration.count() << endl;
}

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