Submission #65443471

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define REP(a,i,n) for (ll i=a;i<n;i++)

char T[101][101];
vector<vector<char> > newS(101, vector<char>(101));
ll mismatch(ll N) {
    ll count=0;
    REP(0, i, N) {
        REP(0, j, N) {
            count += (T[i][j]!=newS[i][j]);
        }
    }
    return count;
}

void turn(vector<vector<char> > &S, ll N) {
    vector<vector<char> > nS(101, vector<char>(101));
    REP(0, i, N) {
        REP(0, j, N) {
            nS[i][j] = S[N-j-1][i];
        }
    }
    S = nS;
}

int main() {
    ll N, mini = 101*101; cin >> N;
    REP(0, i, N) {
        REP(0, j, N) {
            cin >> newS[i][j];
        }
    }
    REP(0, i, N) {
        REP(0, j, N) {
            cin >> T[i][j];
        }
    }
    REP(0, i, 4) {
        mini = min(mini, mismatch(N)+i);
        turn(newS, N);
    }
    cout << mini;
    return 0;
}

Submission Info

Judge Result