[백준 1303: 전쟁 - 전투 ] - C++

www.acmicpc.net/problem/1303

1303번: 전쟁 - 전투

 

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

string map[101][101];
int visited[101][101];

int dir[4][2] = {
	{-1,0}
	,{0,1}
	,{1,0}
	,{0,-1}
};
int whiteCnt;
int blueCnt;
int n, m;
int cnt;
void D(int _x, int _y, string curColor)
{
	for (int i = 0; i < 4; i++)
	{
		int nextX = _x + dir[i][0];
		int nextY = _y + dir[i][1];

		if (nextX < 0 || nextY < 0 || n <= nextX || m <= nextY)
			continue;
		if (map[nextX][nextY] == curColor && visited[nextX][nextY] == 0)
		{
			visited[nextX][nextY] = 1;
			cnt++;
			D(nextX, nextY,curColor);			
		}
	}
}
int main() {


	string input;
	cin >> m >> n;


	for (int i = 0; i < n; i++)
	{
		cin >> input;
		for (int j = 0; j < m; j++)
		{
			map[i][j] = input[j];
		}
	}

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			if (!visited[i][j])
			{
				cnt = 1;
				visited[i][j] = 1;

				if (map[i][j] == "B")
				{
					D(i, j, "B");
					blueCnt += cnt * cnt;
				}
				else if (map[i][j] == "W")
				{
					D(i, j, "W");
					whiteCnt += cnt * cnt;
				}

			}
		}
	}


	cout << whiteCnt << " " << blueCnt << endl;
	return 0;
}