백준 22352번 항체 인식 C++

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

22352번: 항체 인식

 

백신 이전 결과에서 이어진 부분의 영역은 백신 이후 영역에서 백신 이전 결과와는 달라도 되지만 모두 같은 값으로 채워져야 하고 나머지 부분은 백신 이전 결과와 백신 이후 결과가 모두 같은 값이어야 한다.

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

int n, m;

int dRow[4] = { -1,0,1,0 };
int dCol[4] = { 0,1,0,-1 };

vector<vector<int>> beforeBoard;
vector<vector<int>> afterBoard;
vector<vector<bool>> bBFound;
vector<vector<bool>> found;

void RefreshFound() {
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            found[i][j] = false;
        }
    }
}

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

    cin >> n >> m;
    beforeBoard = vector<vector<int>>(n, vector<int>(m));
    afterBoard = vector<vector<int>>(n, vector<int>(m));
    bBFound = vector<vector<bool>>(n, vector<bool>(m, false));
    found = vector<vector<bool>>(n, vector<bool>(m, false));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> beforeBoard[i][j];
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> afterBoard[i][j];
        }
    }
    bool ans = false;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (bBFound[i][j]) continue;
            RefreshFound();
            int val = beforeBoard[i][j];
            vector<pair<int, int>> v;
            queue<pair<int, int>> q;
            bBFound[i][j] = true;
            found[i][j] = true;
            q.push({ i,j });
            v.push_back({ i,j });
            while (!q.empty()) {
                auto curr = q.front();
                q.pop();
                for (int k = 0; k < 4; k++) {
                    int nextRow = curr.first + dRow[k];
                    int nextCol = curr.second + dCol[k];
                    if (nextRow < 0 || nextRow >= n) continue;
                    if (nextCol < 0 || nextCol >= m) continue;
                    if (found[nextRow][nextCol]) continue;
                    if (beforeBoard[nextRow][nextCol] != val) continue;
                    found[nextRow][nextCol] = true;
                    bBFound[nextRow][nextCol] = true;
                    q.push({ nextRow,nextCol });
                    v.push_back({ nextRow,nextCol });
                }
            }
            set<int> s;
            for (auto a : v) {
                s.insert(afterBoard[a.first][a.second]);
            }
            if (s.size() != 1) continue;
            bool isAns = true;
            for (int k = 0; k < n; k++) {
                for (int y = 0; y < m; y++) {
                    if (found[k][y]) continue;
                    if (beforeBoard[k][y] == afterBoard[k][y]) continue;
                    isAns = false;
                }
            }
            if (isAns) ans = true;
        }
    }
    if (ans) cout << "YES";
    else cout << "NO";
}