211213 백준 코딩연습 파이썬 2667 단지번호붙이기

https://solved.ac/

 

파이썬

 

실1 단지번호붙이기

 

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

 

 

import sys
from collections import deque
input = sys.stdin.readline
dx = [-1, 1, 0, 0]
dy = [0, 0, -1, 1]
def bfs(graph, a, b):
    queue = deque()
    queue.append((a, b))
    graph[a][b] = 0
    cnt = 1
    n = len(graph)
    
    while queue:
        x, y = queue.popleft()
 
        for i in range(4):
            nx = x + dx[i]
            ny = y + dy[i]
 
            if nx >= n or ny >= n or nx < 0 or ny < 0:
                continue
            if graph[nx][ny] == 1:
                graph[nx][ny] = 0
                queue.append((nx, ny))
                cnt += 1
    return cnt
 
input = sys.stdin.readline
N = int(input())
house = []
for i in range(N):
    house.append(list(map(int, input().rstrip())))
##print(house)
countHouse = []
for i in range(N):
    for j in range(N):
        if house[i][j] == 1:
            countHouse.append(bfs(house, i, j))
 
countHouse.sort()
print(len(countHouse))
for i in range(len(countHouse)):
    print(countHouse[i])