Codeforces 645A Amity Assessment 【暴力】

题目链接：Codeforces 645A Amity Assessment

题意：给你两个$2*2$矩阵，每次你可以将$X$与周围的$A、B、C$互换，问你这两个矩阵是否可以相互转化。

$AC$代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#define PI acos(-1.0)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define fi first
#define se second
#define ll o<<1
#define rr o<<1|1
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 2*1e5 + 10;
const int pN = 1e6;// <= 10^7
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
char a[2][2], b[2][2];
bool judge() {
    for(int i = 0; i < 2; i++) {
        for(int j = 0; j < 2; j++) {
            if(a[i][j] != b[i][j])
                return false;
        }
    }
    return true;
}
bool Check() {
    int sx, sy;
    for(int i = 0; i < 2; i++) {
        for(int j = 0; j < 2; j++) {
            if(b[i][j] == 'X') {
                sx = i;
                sy = j;
            }
        }
    }
    if(judge()) return true; int nx, ny;
    for(int i = 0; i < 12; i++) {
        if(sx == 0) {
            if(sy == 0) {
                nx = 0; ny = 1;
            }
            else {
                nx = 1; ny = 1;
            }
        }
        else {
            if(sy == 0) {
                nx = ny = 0;
            }
            else {
                nx = 1; ny = 0;
            }
        }
        swap(b[sx][sy], b[nx][ny]);
        sx = nx; sy = ny;
        if(judge()) return true;
    }
    return false;
}
int main()
{
    for(int i = 0; i < 2; i++) {
        cin >> a[i];
    }
    for(int i = 0; i < 2; i++) {
        cin >> b[i];
    }
    bool flag = Check();
    printf(flag ? "YES\n" : "NO\n");
    return 0;
}