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

2667번: 단지번호붙이기 (acmicpc.net)

2667번: 단지번호붙이기

 

from collections import deque
n = int(input())
graph = []
count = []
dx = [-1,1,0,0]
dy = [0,0,-1,1]
 
for _ in range(n):
    graph.append(list(map(int,input())))
 
def apt(x,y):
    que = deque()
    que.append((x,y))
    j = 0
    count = [0]
    while que:
        x,y = que.popleft()
        if graph[x][y] == 1 or graph[x][y]==2:
            if graph[x][y]==1:
                count[0] += 1
            for i in range(4):
                nx = x + dx[i]
                ny = y + dy[i]
                if nx<0 or ny<0 or nx>=n or ny>=len(graph[0]):
                    continue
                if graph[nx][ny]==0:
                    continue
                if graph[nx][ny]==1:
                        que.append((nx,ny))
                        graph[x][y]=2
                        graph[nx][ny]=2
                        count[0]+=1
 
    return count
result = 0
for k in range(n):
    for l in range(len(graph[0])):
        count.append(apt(k,l))
for a in range(len(count)):
    count = [i for i in count if not 0 in i]
count.sort()
 
print(len(count))
for a in range(len(count)):
    print(count[a][0])