2583 영역 구하기

#include <stdio.h>
#include <queue>
 
using namespace std;
 
int check[105][105] = { 0 };
int val = 0, m, n, k;
 
void DFS(int y, int x);
 
int main() {
    scanf("%d %d %d", &m, &n, &k);
 
    for (int i = 1; i <= k; i++) {
        int x1, x2, y1, y2;
        scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
 
        for (int j = y1; j < y2; j++) {
            for (int k = x1; k < x2; k++) {
                check[j][k] = 1;
            }
        }
    }
 
    priority_queue<int> q;
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            if (check[i][j] == 0) {
                check[i][j] = 1;
                val = 0;
                DFS(i, j);
                q.push(-val);
            }
        }
    }
 
    printf("%d\n", q.size());
    while (q.empty() == false) {
        printf("%d ", -q.top());
        q.pop();
    }
}
 
void DFS(int y, int x) {
    if (y >= m || x >= n)
        return;
    val++;
 
    if (y>=1 && check[y - 1][x] == 0) {
        check[y - 1][x] = 1;
    
        DFS(y - 1, x);
    }
    if (check[y + 1][x] == 0) {
        check[y + 1][x] = 1;
 
        DFS(y + 1, x);
    }
    if (x >= 1 && check[y][x - 1] == 0) {
        check[y][x-1] = 1;
 
        DFS(y, x-1);
    }
    if (check[y][x + 1] == 0) {
        check[y][x + 1] = 1;
 
        DFS(y, x + 1);
    }
}