Maalaus

#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>

using pi = std::pair<int, int>;

int getIndex(int priority, const std::vector<pi>& longer) {
    int min = 0;
    int max = longer.size() - 1;

    while (true) {
        if (min == max) {
            if (min == static_cast<int>(longer.size() - 1) && longer.at(min).first < priority) return longer.size();
            return min;
        }
        int middle = (max + min) / 2;

        int val = longer.at(middle).first;

        if (val < priority) min = middle + 1;
        else max = middle;
    }
}

int getIndex2(int priority, const std::vector<pi>& longer) {
    for (int i = 0; i < static_cast<int>(longer.size()); i++) {
        if (longer.at(i).first >= priority) return i;
    }

    return longer.size();
}

std::vector<pi> mapToVec(const std::map<int, pi>& map) {
    std::vector<pi> vec;

    for (auto [key, val] : map) {
        vec.push_back(val);
    }

    std::sort(vec.begin(), vec.end(), [](pi i1, pi i2) { return i1.first < i2.first; });

    return vec;
}

int main([[maybe_unused]] int argc, [[maybe_unused]] char *argv[]) {
    int height, width, colorCount, operations; std::cin >> height >> width >> colorCount >> operations;

    std::map<int, pi> horizontal;
    std::map<int, pi> vertical;

    for (int i = 0; i < operations; i++) {
        char dir; std::cin >> dir;
        int index, color; std::cin >> index >> color;

        (dir == 'R' ? horizontal : vertical)[index] = {i + 1, color};
    }

    std::vector<pi> horizontalVec = mapToVec(horizontal);
    std::vector<pi> verticalVec = mapToVec(vertical);

    long long *colors = new long long[colorCount];

    auto l = [colors](long amogus, const std::vector<pi>& vec1, const std::vector<pi>& vec2) {
        for (std::size_t i = 0; i < vec1.size(); i++) {
            pi guh = vec1.at(i);
            if (guh.first == 0) continue;

            int index = getIndex(guh.first, vec2);
            int zeroCount = amogus - vec2.size();

            colors[guh.second - 1] += index + zeroCount;
        }
    };

    l(width, horizontalVec, verticalVec);
    l(height, verticalVec, horizontalVec);

    for (int i = 0; i < colorCount; i++) {
        std::cout << colors[i] << " ";
    }
}

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: WRONG ANSWER

Test 5

Group: 2, 4

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 13

Group: 2, 4

Verdict: WRONG ANSWER

Test 14

Group: 4

Verdict: WRONG ANSWER

Test 15

Group: 4

Verdict: WRONG ANSWER

Test 16

Group: 4

Verdict: WRONG ANSWER

Test 17

Group: 4

Verdict: WRONG ANSWER