백준 10026번 적록색약

#include <iostream>
#include <vector>

using namespace std;

int n;
char graph[101][101];
bool visited[101][101];
char lastColor;

void dfs(int x, int y) {
	if (x > n || x < 0 || y > n || y < 0
		|| graph[x][y] != lastColor
		|| visited[x][y])
		return;

	visited[x][y] = true;

	dfs(x - 1, y);
	dfs(x, y - 1);
	dfs(x + 1, y);
	dfs(x, y + 1);
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

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

	int result = 0, rgResult = 0;	// rgResult: 적록색약

	for (int i = 0; i < n; ++i){
		for (int j = 0; j < n; ++j) {
			if (!visited[i][j]) {
				lastColor = graph[i][j];
				dfs(i, j);
				++result;
			}
		}
	}

	for (int i = 0; i < n; ++i)
		for (int j = 0; j < n; ++j) {
			visited[i][j] = false;
			if (graph[i][j] == 'R')
				graph[i][j] = 'G';
		}

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			if (!visited[i][j]) {
				lastColor = graph[i][j];
				dfs(i, j);
				++rgResult;
			}
		}
	}

	cout << result << " " << rgResult;

	return 0;
}

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

10026번: 적록색약