#include <bits/stdc++.h>
using namespace std;
#define RNG(i, n) for(int i=0;i<n;i++)
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<int>> arr(n, vector<int>(m));
vector<vector<int>> psc(n+1, vector<int>(m, 0));
RNG(i, n) RNG(j, m) cin >> arr[i][j];
RNG(i, n) RNG(j, m) psc[i+1][j]=psc[i][j]+arr[i][j];
int allBest=1;
RNG(i, n) {
for(int j=i;j<n;j++) {
int h=j-i+1;
int curBest=0;
RNG(k, m) {
int cur=h-2*(psc[j+1][k]-psc[i][k]);
curBest=min(curBest + cur, cur);
allBest=min(allBest, curBest);
}
}
}
int cnt1=0;
RNG(i, m) cnt1+=psc[n][i];
int ans=allBest+cnt1;
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |