Submission #950681

#TimeUsernameProblemLanguageResultExecution timeMemory
950681IrateOrchard (NOI14_orchard)C++14
25 / 25
132 ms19992 KiB
#include<bits/stdc++.h>
using namespace std;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<vector<int>>grid(n + 1, vector<int>(m + 1));
    vector<vector<int>>pref(n + 1, vector<int>(m + 1));
    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 res = 1e9;
    for(int k = 1;k <= n;++k){
        for(int i = 1;i + k - 1 <= n;++i){
            int mn = -1;
            for(int j = 1;j <= m;++j){
                int sum = pref[i + k - 1][j] - pref[i - 1][j];
                res = min(res, j * k - 2 * sum + pref[n][m] + k + mn);
                mn = min(mn, 2 * (pref[i + k - 1][j] - pref[i - 1][j]) - k * (j + 1));
            }
        }
    }
    cout << res << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...