[백준] 3187번 양치기 꿍

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

3187번: 양치기 꿍

#include <iostream>
#include <vector>
#include <queue>
using namespace std;


int main() {
	int n, m;
	cin >> n >> m;
	vector<vector<char>> arr(n, vector<char>(m));
	vector<vector<bool>> visited(n, vector<bool>(m));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> arr[i][j];
			if (arr[i][j] == '#') visited[i][j] = true;
		}
	}
	int surviveSheep = 0;
	int surviveWolf = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (!visited[i][j]) {
				int wolf = 0;
				int sheep = 0;
				queue<pair<int, int>> q;
				q.push(make_pair(i, j));
				while (!q.empty()) {
					pair<int, int> cur = q.front();
					q.pop();
					if (!visited[cur.first][cur.second]) {
						visited[cur.first][cur.second] = true;
						if (arr[cur.first][cur.second] == 'v') wolf++;
						else if (arr[cur.first][cur.second] == 'k') sheep++;
						if (cur.first - 1 >= 0 && !visited[cur.first - 1][cur.second]) {
							q.push(make_pair(cur.first - 1, cur.second));
						}
						if (cur.first + 1 < n && !visited[cur.first + 1][cur.second]) {
							q.push(make_pair(cur.first + 1, cur.second));
						}
						if (cur.second - 1 >= 0 && !visited[cur.first][cur.second - 1]) {
							q.push(make_pair(cur.first, cur.second - 1));
						}
						if (cur.second + 1 < m && !visited[cur.first][cur.second + 1]) {
							q.push(make_pair(cur.first, cur.second + 1));
						}
					}
				}
				if (sheep > wolf) {
					surviveSheep += sheep;
				}
				else {
					surviveWolf += wolf;
				}
			}
		}
	}
	cout << surviveSheep << " " << surviveWolf;
	return 0;
}