백준 2667 단지번호붙이기 (파이썬)

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

2667번: 단지번호붙이기

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

def bfs(x, y, cnt):
    q = [[x, y]]
    check[x][y] = cnt
    while q:
        x = q[0][0]
        y = q[0][1]
        q.pop(0)
        for i in range(4):
            nx = x + dx[i]
            ny = y + dy[i]
            if 0 <= nx < n and 0 <= ny < n:
                if a[nx][ny] == 1 and check[nx][ny] == 0:
                    check[nx][ny] = cnt
                    q.append([nx, ny])

n = int(input())
a = [list(map(int, input())) for _ in range(n)]
check = [[0]*n for _ in range(n)]
cnt = 1
for i in range(n):
    for j in range(n):
        if a[i][j] == 1 and check[i][j] == 0:
            bfs(i, j, cnt)
            cnt += 1
count = [0 for _ in range(cnt)]
for i in range(n):
    for j in range(n):
        if check[i][j] != 0:
            count[check[i][j]] += 1
count = count[1:]
count.sort()
cnt -= 1
print(cnt)
for i in range(cnt):
    print(count[i])