백준 적록색약 10026 BFS

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

10026번: 적록색약

 

• 일반적인 BFS를 구해주고
• 기존 graph에서 모든 R을 G로 바꾼 뒤 다시 BFS 돌림

from collections import deque

N = int(input())
graph = []
for _ in range(N):
    graph.append(input())
visited = [[False] * N for _ in range(N)]
answer = [0] * 2

dx = [1,-1,0,0]
dy = [0,0,-1,1]

queue = deque()
def bfs(i,j,color):
    if visited[i][j]:
        return
    queue.append((i,j))
    visited[i][j] = True

    while(queue):
        x, y = queue.popleft()
        for i in range(4):
            nx = x + dx[i]
            ny = y + dy[i]

            if nx < 0 or nx >= N or ny < 0 or ny >= N:
                continue

            if not visited[nx][ny] and graph[nx][ny] == color:
                visited[nx][ny] = True
                queue.append((nx, ny))

for i in range(N):
    for j in range(N):
        if not visited[i][j]:
            answer[0] += 1
        bfs(i,j,graph[i][j])

for i in range(N):
    graph[i] = graph[i].replace('R', 'G')

visited = [[False] * N for _ in range(N)]
for i in range(N):
    for j in range(N):
        if not visited[i][j]:
            answer[1] += 1
        	bfs(i,j,graph[i][j])

        
for i in answer:
    print(i, end=' ')