#include<bits/stdc++.h>
using namespace std;
const int mxN = 155;
const int mxM = 1e5 + 5;
int grid[mxN][mxM], pref[mxN][mxM];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for(int i = 1;i <= n;++i){
for(int j = 1;j <= m;++j){
cin >> grid[i][j];
pref[i][j] = pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1] + grid[i][j];
}
}
int mn = 1e9;
for(int k = 1;k <= n;++k){
for(int i = 1;i + k - 1 <= n;++i){
set<int>s;
s.insert(-1);
for(int j = 1;j <= m;++j){
auto itr = s.begin();
int sum = pref[i + k - 1][j] - pref[i - 1][j];
mn = min(mn, j * k - 2 * sum + pref[n][m] + k + *itr);
s.insert(2 * (pref[i + k - 1][j] - pref[i - 1][j]) - k * (j + 1));
}
}
}
cout << mn << '\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Correct |
1 ms |
2396 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2392 KB |
Output is correct |
2 |
Correct |
2 ms |
2396 KB |
Output is correct |
3 |
Correct |
2 ms |
2396 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
72 ms |
12456 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
5212 KB |
Output is correct |
2 |
Correct |
18 ms |
5212 KB |
Output is correct |
3 |
Correct |
17 ms |
5212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
30 ms |
41816 KB |
Output is correct |
2 |
Correct |
84 ms |
62808 KB |
Output is correct |
3 |
Correct |
90 ms |
62812 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1046 ms |
68860 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |