[백준] 10026번, 적록색약 (Python)

문제

https://www.acmicpc.net/problem/10026

10026번: 적록색약

 

코드

import collections

n = int(input())
graph = [list(input()) for _ in range(n)]
check = [[False]*n for _ in range(n)]
queue = collections.deque()
dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1]
count1=0
count2=0

def bfs(x,y):
    queue.append((x,y))
    while queue:
        x,y = queue.popleft()
        for i in range(4):
            nx = x + dx[i]
            ny = y + dy[i]
            if 0 <= nx < n and 0 <= ny < n:
                if graph[nx][ny] == graph[x][y] and check[nx][ny] == False:
                    check[nx][ny] = True
                    queue.append((nx,ny))

for x in range(n):
    for y in range(n):
        if check[x][y] == False:
            count1 += 1
            bfs(x,y)
            
for x in range(n):
    for y in range(n):
        if graph[x][y] == 'G':
            graph[x][y] = 'R'

check = [[False]*n for _ in range(n)]

for x in range(n):
    for y in range(n):
        if check[x][y] == False:
            count2 += 1
            bfs(x,y)
            
print(count1, count2)

일반사람이 봤을때 R,G,B에 영역 개수를 구하고

적록색약인 사람이 봤을경우에는 G를 R로 바꿔서 영역 개수를 구하면된다.