[BOJ] 1926번 그림

문제

그림

코드

#include <iostream>
#include <vector>
#include <list>
#include <queue>
#include <stack>

using namespace std;

int board[500][500];
bool visit[500][500];
int n, m;
int dx[4] = {0,0,-1,1};
int dy[4] = {1,-1,0,0};
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
    
    int count = 0;
	int size = 0;
	int max = 0;
	queue<pair<int, int>> q;
    
	cin >> n >> m;
	for (int i = 0; i < n; i++)
		for (int j = 0; j < m; j++)
			cin >> board[i][j];

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			if (board[i][j] == 1 && visit[i][j] == 0)
			{
				visit[i][j] = 1;
				q.push({i, j});
				count++;
			}
			while (!q.empty())
			{
				pair<int, int> cur = q.front();
				q.pop();
				size++;
				for (int i = 0; i < 4; i++)
				{
					int nx = cur.first + dx[i];
					int ny = cur.second + dy[i];
					if (nx < 0 || nx >= n || ny < 0 || ny >= m)
						continue;
					if (visit[nx][ny] || board[nx][ny] != 1)
						continue;
					visit[nx][ny] = 1;
					q.push({nx, ny});
				}
			}
			if (size > max)
				max = size;
			size = 0;
		}
	}
	cout << count << '\n';
	cout << max << '\n';
    return (0);
}