[BOJ] 2667번:단지번호 붙이기

■ 문제풀이

1) dfs 알고리즘

 

■ 해답

n = int(input())

graph = []
for i in range(n):
  graph.append(list(map(int, input())))

def dfs(x, y):
  global count
  if x <= -1 or x >= n or y <= -1 or y >= n:
    return False
  if graph[x][y] == 1:
    count += 1
    graph[x][y] = 0
    dfs(x - 1, y)
    dfs(x + 1, y)
    dfs(x, y - 1)
    dfs(x, y + 1)
    return True
  return False

result = 0
danji = []
count = 0
for i in range(n):
  for j in range(n):
    if dfs(i, j) == True:
      result += 1
      danji.append(count)
      count = 0

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

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

2667번: 단지번호붙이기