10026 적록색약

#include <stdio.h>
#include <string.h>
 
using namespace std;
 
int rst1 = 0, rst2 = 0;
int arr1[105][105] = { 0 };
int arr2[105][105] = { 0 };
int check[105][105] = { 0 };
 
void DFS1(int y, int x, int color);
void DFS2(int y, int x, int color);
 
int main() {
    int n;
    scanf("%d", &n);
    getchar();
 
    for (int i = 1; i <= n; i++) {
        char str[105];
        scanf("%s", &str);
 
        for (int j = 0; j < n; j++) {    
            switch (str[j]) {
                case 'R':
                    arr1[i][j+1] = 1;
                    arr2[i][j+1] = 1;
                    break;
                case 'G':
                    arr1[i][j+1] = 2;
                    arr2[i][j+1] = 1;
                    break;
                case 'B':
                    arr1[i][j+1] = 3;
                    arr2[i][j+1] = 3;
                    break;
            }
        }
    }
 
    int rst = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (check[i][j] == 0) {
                rst++;
                check[i][j] = 1;
                DFS1(i, j,arr1[i][j]);
            }
        }
    }
    printf("%d ", rst);
    
    rst = 0;
    for (int i = 1; i <= n; i++) {
        memset(check[i], 0, sizeof(int) * 105);
    }
 
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (check[i][j] == 0) {
                rst++;
                check[i][j] = 1;
                DFS2(i, j, arr2[i][j]);
            }
        }
    }
    printf("%d", rst);
}
 
void DFS1(int y, int x, int color) {
    if (arr1[y - 1][x] == color && check[y - 1][x] == 0) {
        check[y - 1][x] = 1;
        DFS1(y - 1, x, color);
    }
    if (arr1[y + 1][x] == color && check[y + 1][x] == 0) {
        check[y + 1][x] = 1;
        DFS1(y + 1, x, color);
    }
    if (arr1[y][x-1] == color && check[y][x-1] == 0) {
        check[y][x-1] = 1;
        DFS1(y, x-1, color);
    }
    if (arr1[y][x + 1] == color && check[y][x + 1] == 0) {
        check[y][x + 1] = 1;
        DFS1(y, x + 1, color);
    }
}
 
void DFS2(int y, int x, int color) {
    if (arr2[y - 1][x] == color && check[y - 1][x] == 0) {
        check[y - 1][x] = 1;
        DFS2(y - 1, x, color);
    }
    if (arr2[y + 1][x] == color && check[y + 1][x] == 0) {
        check[y + 1][x] = 1;
        DFS2(y + 1, x, color);
    }
    if (arr2[y][x - 1] == color && check[y][x-1] == 0) {
        check[y][x - 1] = 1;
        DFS2(y, x - 1, color);
    }
    if (arr2[y][x + 1] == color && check[y][x+1] == 0) {
        check[y][x + 1] = 1;
        DFS2(y, x + 1, color);
    }
}