#26 : 10026_적록색약

#26 : Week6_예원이티

Author: yewonahn

이티예원/10026_적록색약.py

@@ -0,0 +1,51 @@
+from collections import deque
+
+def BFS(x,y):
+    q.append((x,y))
+    dx = [-1,0,1,0]
+    dy = [0,1,0,-1]
+    visited[x][y] = 1
+    while q:
+        x, y = q.popleft()
+        for d in range(4):
+            nx = x + dx[d]
+            ny = y + dy[d]
+
+            # 범위 안에 있고
+            # 같은 색이고
+            # 방문 안한 경우
+            if 0<=nx<N and 0<=ny<N and a[nx][ny] == a[x][y] and not visited[nx][ny]:
+                # 방문 여부 확인 후, 큐에 넣음
+                visited[nx][ny] = 1  
+                q.append((nx,ny))
+
+
+N = int(input())
+a = [list(input()) for _ in range(N)]
+q = deque()
+
+visited = [[0] * N for _ in range(N)]
+cnt1 = 0
+
+# 적록색약 아닌 경우
+for i in range(N):
+    for j in range(N):
+        if not visited[i][j]:
+            BFS(i,j)
+            cnt1 += 1
+
+# 적록색약인 경우
+for i in range(N):
+    for j in range(N):
+        if a[i][j] == 'G':
+            a[i][j] = 'R'
+
+visited = [[0] * N for _ in range(N)]
+cnt2 = 0
+for i in range(N):
+    for j in range(N):
+        if not visited[i][j]:
+            BFS(i,j)
+            cnt2 += 1
+
+print(cnt1, cnt2)