[백준] 2667: 단지번호붙이기

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

 

 

from collections import deque
n = int(input())
graph = [ list(map(int, input())) for _ in range(n) ]
dx = [ -1, 1, 0, 0 ]
dy = [ 0, 0, -1, 1 ]
answer = []
cnt = 0 #1
res = 0 #2

def bfs(x, y):
    global cnt
    graph[x][y] = 2 #3
    q = deque()
    q.append((x,y)) #4
    
    while q:
        x, y = q.popleft()
        cnt += 1 #5
        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] == 1:
                    graph[nx][ny] = 2
                    q.append((nx, ny))
    return cnt #6

for i in range(n):
    for j in range(n):
        if graph[i][j] == 1: #7
            answer.append(bfs(i, j))
            res += 1
            cnt = 0 

answer.sort()
print(res)
for i in answer:
    print(i)