[백준] 2583번:영역 구하기 (python 파이썬)

문제

www.acmicpc.net/problem/2583

2583번: 영역 구하기

 

소스코드

import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)
def dfs(x, y):
    global flg
    dx = [-1, 1, 0, 0]
    dy = [0, 0, -1, 1]
    visited[y][x]=1
    flg += 1
    for i in range(4):
        nowx, nowy = x+dx[i], y+dy[i]
        if 0<=nowx<n and 0<=nowy<m and visited[nowy][nowx]==0 and arr[nowy][nowx]==0:
            dfs(nowx, nowy)
    return area

m, n, k = map(int, input().split())
arr = [[0]*n for _ in range(m)]
for _ in range(k):
    a, b, c, d = map(int, input().split())
    for i in range(b, d):
        for j in range(a, c):
            if arr[i][j] == 0:
                arr[i][j] = 1
visited = [[0]*n for _ in range(m)]
cnt = 0
area = []
flg = 0
for i in range(m):
    for j in range(n):
        if arr[i][j] == 0 and visited[i][j]==0:
            cnt += 1
            dfs(j, i)
            area.append(flg)
            flg = 0
print(cnt)
print(' '.join(map(str, sorted(area))))