0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-24 17:51:58 +00:00

E - Matrix and Shifts

https://codeforces.com/contest/1660/submission/151560185
This commit is contained in:
Baoshuo Ren 2022-03-31 23:40:55 +08:00
parent e192ddb501
commit 2be521f43a
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

38
CodeForces/1660/E/E.cpp Normal file
View File

@ -0,0 +1,38 @@
#include <cstdio>
#include <iostream>
using std::cin;
using std::cout;
const char endl = '\n';
const int N = 2005;
int t, n, a[N][N], sum, ans;
int main() {
cin >> t;
while (t--) {
sum = 0;
ans = 0x3f3f3f3f;
cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
scanf("%1d", &a[i][j]);
sum += a[i][j];
}
}
for (int i = 1; i <= n; i++) {
int cnt = 0;
for (int j = 1; j <= n; j++) {
cnt += a[(i + j - 1) % n + 1][j];
}
ans = std::min(ans, n - cnt + sum - cnt);
}
cout << ans << endl;
}
return 0;
}