[Gold V] Title: 적록색약, Time: 148 ms, Memory: 115152 KB -BaekjoonHub

Author: wlsgur11

백준/Gold/10026. 적록색약/README.md

@@ -4,15 +4,15 @@
 
 ### 성능 요약
 
-메모리: 115528 KB, 시간: 156 ms
+메모리: 115152 KB, 시간: 148 ms
 
 ### 분류
 
 너비 우선 탐색, 깊이 우선 탐색, 그래프 이론, 그래프 탐색
 
 ### 제출 일자
 
-2025년 3월 20일 12:05:07
+2025년 3월 29일 12:08:57
 
 ### 문제 설명
 

백준/Gold/10026. 적록색약/적록색약.py

@@ -1,57 +1,48 @@
 from collections import deque
 
-N = int(input())
-RGB = [list(map(str, input())) for _ in range(N)]
-
-dx = [-1, 1, 0, 0]
-dy = [0, 0, -1, 1]
-
-visited = [[False] * N for _ in range(N)]
 
-def bfs1(i, j):
+def bfs(i, j, A):
     q = deque([(i, j)])
 
     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 not visited[nx][ny] and RGB[nx][ny] == RGB[x][y]:
+        for i in range(4):
+            nx, ny = x + dx[i], y + dy[i]
+            if 0 <= nx < N and 0 <= ny < N and not visited[nx][ny] and A[nx][ny] == A[x][y]:
                 visited[nx][ny] = True
-                q.append((nx, ny))
+                q.append((nx, ny)) 
 
-def bfs2(i, j):
-    q = deque([(i, j)])
+N = int(input())
 
-    while q:
-        x, y = q.popleft()
-        visited[x][y] = True
-        for d in range(4):
-            nx = x + dx[d]
-            ny = y + dy[d]
-            if 0 <= nx < N and 0 <= ny < N and not visited[nx][ny]:
-                if RGB[x][y] != 'B' and RGB[nx][ny] != 'B':
-                    visited[nx][ny] = True
-                    q.append((nx, ny))
-                elif RGB[x][y] == 'B' and RGB[nx][ny] == 'B':
-                    visited[nx][ny] = True
-                    q.append((nx, ny))
-
-ans1 = 0
-ans2 = 0
+change_normal = {'R': 1, 'G': 2, 'B': 3}
+change_blind = {'R': 1, 'G': 1, 'B': 2}
 
+first = [list(map(str, input())) for _ in range(N)]
+
+normal = [[0] * N for _ in range(N)]
+blind = [[0] * N for _ in range(N)]
 for i in range(N):
     for j in range(N):
-        if not visited[i][j]:
-            bfs1(i, j)
-            ans1 += 1
+        normal[i][j] = change_normal[first[i][j]]
+        blind[i][j] = change_blind[first[i][j]]
 
 visited = [[False] * N for _ in range(N)]
+dx = [-1, 1, 0, 0]
+dy = [0, 0, -1, 1]
+
+ans = [0, 0]
 
 for i in range(N):
     for j in range(N):
         if not visited[i][j]:
-            bfs2(i, j)
-            ans2 += 1
+            bfs(i, j, normal)
+            ans[0] += 1
+
+visited = [[False] * N for _ in range(N)]
+for i in range(N):
+    for j in range(N):
+        if not visited[i][j]:
+            bfs(i, j, blind)
+            ans[1] += 1
 
-print(ans1, ans2)
+print(*ans)