10026번: 적록색약

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

풀이

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <string>
#include <queue>

using namespace std;

int N;
char Paint1[100][100];
char Paint2[100][100];

int DirR[4]{-1, 0, 1, 0};
int DirC[4]{0, 1, 0, -1};

void BFS(char Paint[100][100])
{
    int Output{};
    for (int i = 0; i < N; ++i)
    {
        for (int j = 0; j < N; ++j)
        {
            if (Paint[i][j] != 'E')
            {
                char CurrentChar = Paint[i][j];
                queue<pair<int, int>> Q;
                Q.push(make_pair(i, j));
                Paint[i][j] = 'E';

                while (!Q.empty())
                {
                    int CurrentR = Q.front().first;
                    int CurrentC = Q.front().second;

                    Q.pop();

                    for (int k = 0; k < 4; ++k)
                    {
                        int CheckR = CurrentR + DirR[k];
                        int CheckC = CurrentC + DirC[k];

                        if (0 > CheckR || 0 > CheckC || N <= CheckR || N <= CheckC
                            || Paint[CheckR][CheckC] != CurrentChar)
                        {
                            continue;
                        }

                        Q.push(make_pair(CheckR, CheckC));
                        Paint[CheckR][CheckC] = 'E';
                    }
                }

                ++Output;
            }
        }
    }
    cout << Output << ' ';
}

int main()
{
    ios_base::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
    //freopen("input.txt", "rt", stdin);

    cin >> N;

    string Colors;
    for (int i = 0; i < N; ++i)
    {
        cin >> Colors;
        for (int j = 0; Colors[j] != '\0'; ++j)
        {
            Paint2[i][j] = Paint1[i][j] = Colors[j];
            if ('G' == Colors[j])
            {
                Paint2[i][j] = 'R';
            }
        }
    }

    BFS(Paint1);
    BFS(Paint2);

    return 0;
}