Submission #65429677

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define INF 0x7fffffff
#define inf 0x3f3f3f3f
#define endl '\n'
#define int long long
#define PII pair<int,int>
#define mod 998244353
const int MOD=1e9+7;
const int N=1e5+10;
int read() {char act = 0;int f = 1, x= 0;while (act = getchar(), act < '0' && act != '-');if (act == '-') f = -1, act = getchar();x = act - '0';while (act = getchar(), act >= '0') x = x * 10 + act - '0';return x * f;}
vector<string> rotate90(const vector<string>& grid) {
    int n = grid.size();
    vector<string> new_grid(n, string(n, '.'));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            new_grid[i][j] = grid[n - 1 - j][i];
        }
    }
    return new_grid;
}

int cal(const vector<string>& a, const vector<string>& b) {
    int cnt = 0;
    int n = a.size();
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (a[i][j] != b[i][j]) {
                cnt++;
            }
        }
    }
    return cnt;
}

signed main() {
    int N;
    cin >> N;
    vector<string> S(N), T(N);
    for (int i = 0; i < N; ++i) {
        cin >> S[i];
    }
    for (int i = 0; i < N; ++i) {
        cin >> T[i];
    }

    vector<vector<string>> rotations;
    rotations.push_back(S);
    vector<string> s1 = rotate90(S);
    rotations.push_back(s1);
    vector<string> s2 = rotate90(s1);
    rotations.push_back(s2);
    vector<string> s3 = rotate90(s2);
    rotations.push_back(s3);

    int ans = 1e9;
    for (int k = 0; k < 4; ++k) {
        int dif = cal(rotations[k], T);
        int ops = k + dif;
        if (ops < ans) {
            ans = ops;
        }
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result