[백준] 1018번_체스판다시칠하기

문제 링크 : https://www.acmicpc.net/problem/1018

1018번: 체스판 다시 칠하기

n,m = map(int,input().split())
board = [list(input()) for _ in range(n)]
color = n*m
for i in range(n-7):
    for j in range(m-7):
        #흰
        w=0
        for k in range(i,i+8):
            for s in range(j,j+8):
                if (k%2==0 and s%2==0) or (k%2==1 and s%2==1):
                    if board[k][s] == "B":
                        w += 1
                elif (k%2==0 and s%2==1) or (k%2==1 and s%2==0):
                    if board[k][s] == "W":
                        w += 1
        #검
        b=0
        for k in range(i,i+8):
            for s in range(j,j+8):
                if (k%2==0 and s%2==0) or (k%2==1 and s%2==1):
                    if board[k][s] == "W":
                        b += 1
                elif (k%2==0 and s%2==1) or (k%2==1 and s%2==0):
                    if board[k][s] == "B":
                        b += 1
        #최소
        color = min(color,w,b)
print(color)
                   

왜 이렇게 오래걸렸지...