Submission #1030800

#	Time	Username	Problem	Language	Result	Execution time	Memory
1030800		Khanhcsp2	Orchard (NOI14_orchard)	C++14	20 / 25	113 ms	19728 KiB

orchard

#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, a[151][N], pfs[151][N];
void sol()
{
    cin >> m >> n;
    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();
    }
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 0 / 5
• Subtask 4: 3 / 3
• Subtask 5: 4 / 4
• Subtask 6: 5 / 5