백준 전쟁-전투

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

1303번: 전쟁 - 전투

쉽네요 

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

struct Point {
	int i, j, cnt;
	char c;
};

void Prints(vector<vector<int>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j];
		}
		cout << endl;
	}
	cout << endl;
}

void Prints(vector<vector<bool>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j];
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<vector<char>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j];
		}
		cout << endl;
	}
	cout << endl;
}

int main() {
	int n,m;

	cin >> n>>m ;
	vector<bool>tmpVisited(n, false);
	vector<vector<bool>>bVisited(m, tmpVisited);


	vector<vector<char>>maps;
	for(int i=0;i<m;i++){
		string str;
		cin >> str;
		vector<char>tmpMaps;
		for (int j = 0; j < n; j++) {

			tmpMaps.push_back(str[j]);

		}
		maps.push_back(tmpMaps);
	}
	//cout << endl;
	//Prints(maps, n, n);
	int wSum = 0;
	int  bSum = 0;
	bool bCheck = false;
	vector<int>wData;
	vector<int>bData;
	for (int z = 0; z < m; z++) {
		for (int t = 0; t < n; t++) {
			int wcnt = 0;
			int bcnt = 0;
			bool bWhite = false;
			
			if (bVisited[z][t] ==false ) {
				bCheck = true;
				Point p;
				p.i = z;
				p.j = t;
				p.c = maps[z][t];
				if (p.c == 'W') {
					wcnt++;
				}
				else if (p.c == 'B') {
					bcnt++;
				}
				bVisited[z][t] = true;
				queue<Point>q;
				q.push(p);
				
				int diri[] = {1,-1,0,0};
				int dirj[] = {0,0,1,-1};
				while (!q.empty()) {
					Point start = q.front();
					q.pop();
					
					for (int i = 0; i < 4; i++) {
						int tmpDiri = start.i+ diri[i];
						int tmpDirj = start.j + dirj[i];
						if (tmpDiri == -1 || tmpDirj == -1 || tmpDiri >= m || tmpDirj >= n||bVisited[tmpDiri][tmpDirj]==true) {
							continue;
						}
						if (start.c != maps[tmpDiri][tmpDirj]) {
							continue;
						}
						Point p;
						p.i = tmpDiri;
						p.j = tmpDirj;
						p.c = maps[tmpDiri][tmpDirj];
						bVisited[tmpDiri][tmpDirj] = true;
						q.push(p);
						if (p.c == 'W') {
							wcnt++;
						}
						else if (p.c == 'B') {
							bcnt++;
							
						}
						
					}
				}

			}
			if (wcnt > 0) {
				//cout << wcnt<<",";
				wData.push_back(wcnt);
				//wSum += wcnt;
				
				//cout << wSum;
			}
			if (bcnt > 0) {
				//cout << bcnt << ",";
				bData.push_back(bcnt);
				//bSum += bcnt;
				//cout << bSum;
			}
			
		}
	}
	for (int i = 0; i < wData.size(); i++) {
		wSum += pow(wData[i], 2);
	}
	
	for (int i = 0; i < bData.size(); i++) {
		bSum += pow(bData[i], 2);
	}
	cout << wSum<<" "<< bSum;
	return 0;
}