[백준] 2583번 영역 구하기 파이썬 코드

코드

import sys
sys.setrecursionlimit(10**6)

m,n,k = map(int, input().split())
paper = [[0] * n for _ in range(m)]

for _ in range(k):
  x1, y1, x2, y2 = map(int, input().split())
  for i in range(y1, y2):
    for j in range(x1, x2):
      paper[i][j] = 1
count = 0

def dfs(x,y, graph):
  global count
  if (0 <=x <m and 0 <=y <n) and graph[x][y] == 0:
    graph[x][y] = 5
    count += 1
    dfs(x+1, y, graph)
    dfs(x-1, y, graph)
    dfs(x, y+1, graph)
    dfs(x, y-1, graph)
  return count

area = []
for i in range(m):
  for j in range(n):
    cnt = dfs(i, j, paper)
    if cnt:
      area.append(cnt)
      count = 0
area.sort()
print(len(area))
print(*area)