Maalaus

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <unordered_set>

using namespace std;

class Line
{
public:
    int main_color;
    unordered_set<int> off_colors_set;
    void add_off_color(int pos) {
        /*if (main_color == color)
        {
            duplicate += 1;
            return; 
        }*/
        off_colors_set.insert(pos);
        //printf("Added off color (%d) to line (%d)(%d) to pos (%d). \n", color, n, dir, pos);
        
    }
    void paint_line(int new_color){
        off_colors_set.clear();
        //printf("Size of off_colors_list: %d\n", off_colors_list.size());
        main_color = new_color;
    }
    unordered_set<int> get_colors()
    {
        return off_colors_set;
    }
};



int main()
{   
    const int ROW = -1;
    const int COLUMN = 1;
    // Get starting values 
    int n, m, k, q;
    cin >> n;
    cin >> m;
    cin >> k;
    cin >> q;


    // color list
    vector<long> colors(k, 0);

    map<int, map<int, Line>> lines;
    lines[ROW] = {};
    lines[COLUMN] = {};

    vector<int> active_rows;
    vector<int> active_columns;

    // get operations
    for (int i = 0; i < q; i++)
    {
        int direction, n, color;
        string dir;
        cin >> dir;
        if (dir == "R")
        {
            direction = ROW;
        }
        else
        {
            direction = COLUMN;
        }
        cin >> n;
        n--;
        cin >> color;
        color--;

        if (lines[direction].count(n))
        {
            //cout << "This should be printed exactly once.\n";
            lines[direction].at(n).paint_line(color);
        }
        else
        {
            Line new_line;
            new_line.paint_line(color);
            Line& new_line_ref = new_line;
            lines[direction][n] = new_line_ref;
            if (direction == ROW)
            {
                active_rows.push_back(n);
            }
            else
            {
                active_columns.push_back(n);
            }
        }
        if (direction == ROW)
        {
            for (auto &&line : active_columns)
            {
                lines[COLUMN][line].add_off_color(n);
            }
        }
        else
        {
            for (auto &&line : active_rows)
            {
                lines[ROW][line].add_off_color(n);
            }
        }
        
    }


    // calculate number of colors
    for (auto &&active : active_rows)
    {
        Line& line = lines[ROW][active];
        //printf("row (%d) off colors: %d \n", lines[ROW][active].n, lines[ROW][active].get_color_list().size());
        colors[line.main_color] += (m - line.get_colors().size());
    }
    for (auto &&active : active_columns)
    {
        Line& line = lines[COLUMN][active];
        colors[line.main_color] += (n - line.get_colors().size());
    }

    for (auto &&color : colors)
    {
        cout << color << " ";
    }
    
    
    
    

    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: TIME LIMIT EXCEEDED

Test 5

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 3, 4

Verdict: ACCEPTED

Test 7

Group: 3, 4

Verdict: ACCEPTED

Test 8

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 1, 3, 4

Verdict: ACCEPTED

Test 11

Group: 1, 3, 4

Verdict: ACCEPTED

Test 12

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 2, 4

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 4

Verdict: TIME LIMIT EXCEEDED