[23.01.08/Python] 단지번호붙이기

Author: par3k

Python_BOJ_2023/2667.py

@@ -0,0 +1,31 @@
+n = int(input())
+graph = [list(map(int, input())) for _ in range(n)]
+visited = [[0 for _ in range(n)] for _ in range(n)]
+dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1]
+cnt = 0
+
+def dfs(x, y):
+    global cnt
+    visited[x][y] = 1
+    if graph[x][y] == 1:
+        cnt += 1
+    
+    for i in range(4):
+        nx, ny = x + dx[i], y + dy[i]
+        if 0 <= nx < n and 0 <= ny < n:
+            if not visited[nx][ny]:
+                if graph[nx][ny] == 1:
+                    dfs(nx, ny)
+
+answer = list()
+for i in range(n):
+    for j in range(n):
+        if graph[i][j] == 1 and not visited[i][j]:
+            dfs(i, j)
+            answer.append(cnt)
+            cnt = 0
+
+print(len(answer))
+answer.sort()
+for i in answer:
+    print(i)