Submission #4034598

---

Source Code Expand

n, k = map(int, input().split())
white = [[0 for _ in range(k+1)] for _ in range(2*k+1)]

for _ in range(n):
	x, y, c = input().split()
	x, y = (int(x) - 1) % (2*k), (int(y) - 1) % (2*k)
	if (c == "B") ^ (y >= k):
		x = (x-k) % (2*k)
		
	y %= k

	if x < k:
		white[0][0] += 1
		white[x][0] += -1
		white[x+k][0] += -1
		white[2*k][0] += 1
		white[0][y] += -1
		white[x][y] += 2
		white[x+k][y] += -2
		white[2*k][y] += 1
		white[x][k] += -1
		white[x+k][k] += 1

	else:
		white[x-k][0] += 1
		white[x][0] += -1
		white[0][y] += 1
		white[x-k][y] += -2
		white[x][y] += 2
		white[2*k][y] += -1
		white[0][k] += -1
		white[x-k][k] += 1
		white[x][k] += -1
		white[2*k][k] += 1

#print(white)

for i in range(2*k+1):
	for j in range(k):
		white[i][j+1] += white[i][j]

for j in range(k+1):
	for i in range(2*k):
		white[i+1][j] += white[i][j]

#print(white)

ans = 0
for i in range(2*k):
	for j in range(k):
		ans = max(ans, white[i][j])

print(ans)

Submission Info

Judge Result