백준 소스코드 [C++] 2583 영역 구하기

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

2583번: 영역 구하기

백준 소스코드 [C++] 2583 영역 구하기

#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int arr[502][502];
bool check[502][502];
pair<int, int> p[4] = { {1,0},{-1,0},{0,1},{0,-1} };
queue <pair<int, int>> q;
int bfs() {
	int maxvalue = 0;
	while (q.empty() != true) {
		pair<int, int> pp = q.front();
		q.pop();
		maxvalue++;
		for(int a=0;a<4;a++)
			if (arr[pp.first + p[a].first][pp.second + p[a].second] == 2 &&
				check[pp.first + p[a].first][pp.second + p[a].second] == false)
			{
				check[pp.first + p[a].first][pp.second + p[a].second] = true;
				q.push({ pp.first + p[a].first, pp.second + p[a].second });
				
			}
	}
	return maxvalue;
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n, m,k;
	cin >> n >> m>>k;
	int left,right,up,down;
	vector<int>v;
	for (int i = 1;i <= n;i++)for (int j = 1;j <= m;j++) arr[i][j] = 2;
	for (int i = 0;i < k;i++) {
		cin >> left >> down >> right >> up;
		for (int i = left + 1;i <= right;i++)for (int j = down + 1;j <= up;j++) arr[j][i] = 1;
	}

	for (int i = 1;i <= n;i++)for (int j = 1;j <= m;j++) 
		if (arr[i][j] == 2 && check[i][j] == false) {
			check[i][j] = true;
			q.push({ i,j });
			v.push_back(bfs());
	}
	sort(v.begin(), v.end());
	cout << v.size() << '\n';
	for (int i = 0;i < v.size();i++) cout << v[i] << " ";
	return 0;
}