| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1030807 | Khanhcsp2 | Orchard (NOI14_orchard) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=1e5+11;
int m, n;
void sol()
{
cin >> m >> n;
vector<vector<int>> a(m+1);
for(int i=1;i<=m;i++) a.resize(m+1, 0);
vector<vector<int>> pfs(m+1);
for(int i=1;i<=m;i++) pfs.resize(m+1, 0);
for(int i=1;i<=m;i++) for(int j=1;j<=n;j++)
{
cin >> a[i][j];
pfs[i][j]=pfs[i-1][j]+pfs[i][j-1]-pfs[i-1][j-1]+a[i][j];
}
int ans=1e18, all=pfs[m][n];
for(int len=1;len<=m;len++)
{
for(int i=1;i+len-1<=m;i++)
{
int ma=0;
for(int j=1;j<=n;j++)
{
int sl1=pfs[i+len-1][j]-pfs[i-1][j];
ans=min(ans, all+j*len-2*sl1-ma);
ma=max(ma, j*len-2*sl1);
}
}
}
cout << ans;
}
signed main()
{
// freopen("divisor.INP", "r", stdin);
// freopen("divisor.OUT", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin >> t;
while(t--)
{
sol();
}
}