[BOJ] 10026 적록색약 Python

from collections import deque
N= int(input())
picture1 = [[] for _ in range (0,N)]
picture2 = [[] for _ in range (0,N)]
for i in range (0,N):
    a = list(input())
    for j in range (0,N):
        if a[j] == "B":
            picture1[i].append(a[j])
            picture2[i].append(a[j])
        else:
            picture1[i].append(a[j])
            picture2[i].append("G") #R이 G가 된다고 생각하자.
visited1 = [[False for _ in range (0,N)] for _ in range (0,N)]
visited2 = [[False for _ in range (0,N)] for _ in range (0,N)]

dx,dy = [0,0,1,-1],[1,-1,0,0]
cnt1,cnt2 = 0,0
for i in range (0,N):
    for j in range (0,N):
        if visited1[i][j] == False:
            cnt1 += 1
            deq = deque()
            deq.appendleft([i,j])
            while deq:
                x = deq.popleft()
                visited1[x[0]][x[1]] = True
                for k in range (0,4):
                    a = x[0] + dx[k]
                    b = x[1] + dy[k]
                    if 0 <= a < N and 0 <= b < N and visited1[a][b] == False and picture1[a][b] == picture1[x[0]][x[1]]:
                        deq.appendleft([a,b])
        if visited2[i][j] == False:
            cnt2 += 1
            deq = deque()
            deq.appendleft([i,j])
            while deq:
                x = deq.popleft()
                visited2[x[0]][x[1]] = True
                for k in range (0,4):
                    a = x[0] + dx[k]
                    b = x[1] + dy[k]
                    if 0 <= a < N and 0 <= b < N and visited2[a][b] == False and picture2[a][b] == picture2[x[0]][x[1]]:
                        deq.appendleft([a,b])
print(cnt1,cnt2)

 

그냥 조오금 복잡할 뻔한 BFS / DFS 유형이었다