[Softeer] 장애물 인식 프로그램

https://softeer.ai/practice/info.do?idx=1&eid=409

Softeer

 

DFS 알고리즘을 이용했다.

import sys

n = int(input())
Map = [list(map(int, input())) for _ in range(n)]
answer = []
res = 0
def dfs(x, y):
    if x<0 or x>=n or y<0 or y>=n:
        return 0
    if Map[x][y]:
        Map[x][y] = 0
        count = 1
        count += dfs(x-1, y)
        count += dfs(x, y-1)
        count += dfs(x+1, y)
        count += dfs(x, y+1)
        return count
    return 0

for i in range(n):
    for j in range(n):
        res = dfs(i, j)
        if res:
            answer.append(res)
print(len(answer))
answer.sort()
for i in answer:
    print(i)