Maalaus

def binarySearch(arr, x):
    low = 0
    high = len(arr) - 1
    ans = -1
    while low <= high:
        mid = (low + high) // 2
        if arr[mid] <= x:
            ans = mid
            low = mid + 1
        else:
            high = mid - 1
    return ans + 1

n, m, k, q = map(int, input().split())

R = {}
C = {}


for t in range(1, q + 1):
    r, i, c = input().split()

    if r == "R":
        R[i] = (int(c), t)
    elif r == "C":
        C[i] = (int(c), t)

            
R_ages = sorted([a for (_, a) in R.values()])
C_ages = sorted([a for (_, a) in C.values()])

colors = [0] * k

R_list = list(R.values())
for color, age in R_list:
    count_cols = binarySearch(C_ages, age) + (m - len(C_ages))
    colors[color - 1] += count_cols


C_list = list(C.values())
for color, age in C_list:
    count_rows = binarySearch(R_ages, age) + (n - len(R_ages))
    colors[color - 1] += count_rows

result = []
for i in range(1, k+1):
    result.append(str(colors[i - 1]))
        
print(' '.join(result))

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