Submission #2869649

---

Source Code Expand

# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul

sys.setrecursionlimit(10000)


def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, K, XYC):
    ans = []
    for i in range(K):
        for j in range(K):
            # print(i, j)
            a_w = 0
            a_b = 0
            for x, y, c in XYC:
                x_ = ((x+j) // K) % 2
                y_ = ((y+i) // K) % 2
                if (x_ + y_) % 2 == 0:
                    if c == 'W':
                        a_w += 1
                    else:
                        a_b += 1
                else:
                    if c == 'B':
                        a_w += 1
                    else:
                        a_b += 1
            ans.append(a_w)
            ans.append(a_b)
            # print(ans[-2])
            # print(ans[-1])
    return max(ans)


def main():
    N, K = read_int_n()
    XYC = [read_str_n() for _ in range(N)]
    XYC = list(map(lambda x: (int(x[0]), int(x[1]), x[2]), XYC))
    print(slv(N, K, XYC))


if __name__ == '__main__':
    main()

Submission Info

Judge Result