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

문제 링크

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

2667번: 단지번호붙이기

풀이 - 다시 품 

from collections import deque

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

def bfs(i,j):
  # 단지 개수 저장 
  count = 1 
  queue = deque()
  queue.append((i,j))
  maps[i][j] = 0 

  while queue:
    x, y = queue.popleft()

    for i in range(4):
      nx = x + dx[i]
      ny = y + dy[i]
      if 0<=nx < n and 0<= ny < n and maps[nx][ny] == 1:
        maps[nx][ny] = 0 
        queue.append((nx,ny))
        count += 1 
  
  return count 

n = int(input())

maps = []

for i in range(n):
  maps.append(list(map(int,input())))

result = []
for i in range(n):
  for j in range(n):
    if maps[i][j] == 1 :
      result.append(bfs(i,j))

result.sort()
print(len(result))
for i in result:
  print(i)