[백준 3187: 양치기 꿍] - C++

www.acmicpc.net/problem/3187

3187번: 양치기 꿍

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

using namespace std;
string map[251][251];
int chk[251][251];
int kNum;
int vNum;
int r, c;
int dir[5][2] = {
	{-1,0}
	,{0,1}
	,{0,0}
	,{1,0}
	,{0,-1}
};
void D(int _x, int _y)
{
	for (int i = 0; i < 5; i++)
	{
		int nextX = _x + dir[i][0];
		int nextY = _y + dir[i][1];

		if (nextX < 1 || nextY < 1 || r < nextX || c < nextY)
			continue;
		if (map[nextX][nextY] != "#" && chk[nextX][nextY] == 0)
		{			
			if (map[nextX][nextY] == "v")
			{
				vNum++;
			}
			else if (map[nextX][nextY] == "k")
			{
				kNum++;
			}
			chk[nextX][nextY] = 1;
			D(nextX, nextY);
		}
	}
}
int main()
{

	string input;
	cin >> r >> c;
	for (int i = 1; i <= r; i++)
	{
		cin >> input;
		for (int j = 1; j <= c; j++)
		{
			map[i][j] = input[j-1];
		}
	}

	int kResult = 0;
	int vResult = 0;

	for (int i = 1; i <= r; i++)
	{
		for (int j = 1; j <= c; j++)
		{
			if (map[i][j] == "v" || map[i][j] == "k")
			{
				kNum = 0;
				vNum = 0;
				D(i, j);
				if (vNum < kNum)
				{
					kResult += kNum;
				}
 				else if (vNum >= kNum)
				{					
					vResult += vNum;
				}
			}
		}
	}


	cout << kResult << " " << vResult << endl;
	return 0;
}