Submission #65426323

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define db double
#define i128 __int128
#define ui unsigned int
#define ull unsigned long long

mt19937 rng_32(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const ull X=rng_64();
ull splitmix64(ull x) {
	x^=x<<13;
	x^=x>>7;
	x^=x<<17;
	return x;
}
ull rng(ull x){return splitmix64(x+X);}

const int N=100;
int n;
char a[N+10][N+10],b[N+10][N+10];
int calc(){
	int res=0;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			res+=(a[i][j]!=b[i][j]);
	return res;
}
char c[N+10][N+10];
void sol(){
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			c[j][n+1-i]=a[i][j];
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			a[i][j]=c[i][j];
}

int main(){
	ios::sync_with_stdio(0),cin.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			cin>>a[i][j];
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			cin>>b[i][j];
	int ans=1e9;
	ans=min(ans,calc());
	sol();
	ans=min(ans,calc()+1);
	sol();
	ans=min(ans,calc()+2);
	sol();
	ans=min(ans,calc()+3);
	sol();
	cout<<ans<<'\n';
	return 0;
}
/*
Cyber malody E judge fc choke.

g++ test.cpp -o test -std=c++14 -O2 -Wall -Wshadow ulimit -s 5120000
./test
*/

Submission Info

Judge Result