백준 2583 영역 구하기(bfs)

https://www.acmicpc.net/problem/2583

2583번: 영역 구하기

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;
const int MAX = 100;
int M, N, K;
bool visited[MAX][MAX];
int cnt;
typedef struct
{
    int x, y;
} Dir;
Dir Dirmove[4] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int domain;
vector<int> answer;

void bfs(int x, int y)
{
    domain++;
    queue<pair<int, int>> q;
    q.push(make_pair(x, y));
    visited[x][y] = true;
    while (!q.empty())
    {
        int x = q.front().first;
        int y = q.front().second;
        q.pop();
        for (int i = 0; i < 4; i++)
        {
            int nextX = x + Dirmove[i].x;
            int nextY = y + Dirmove[i].y;
            if (0 <= nextX && nextX < M && 0 <= nextY && nextY < N && !visited[nextX][nextY])
                bfs(nextX, nextY);
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> M >> N >> K;
    for (int i = 0; i < K; i++)
    {
        int x1, y1, x2, y2;
        cin >> y1 >> x1 >> y2 >> x2; //도형을 위아래로 뒤집는다 생각.
        for (int i = x1; i < x2; i++)
            for (int j = y1; j < y2; j++)
                visited[i][j] = true;
    }
    for (int i = 0; i < M; i++)
    {
        for (int j = 0; j < N; j++)
        {
            if (!visited[i][j])
            {
                cnt++;
                bfs(i, j);
                answer.push_back(domain);
            }
            domain = 0;
        }
    }
    cout << cnt << "\n";
    sort(answer.begin(), answer.end());
    for (int i = 0; i < answer.size(); i++)
        cout << answer[i] << " ";
}

dfs 공부 꽤 햇으니 여태껏 풀엇던 문제들을 싹 다 bfs로도 푸러본다