Submission #18525

#	Time	Username	Problem	Language	Result	Execution time	Memory
18525		eaststar	Orchard (NOI14_orchard)	C++14	25 / 25	257 ms	83120 KiB

orchard

#include <stdio.h>
#include <string.h>
int main(){
    int i,j,k,l,n,m,ans=1e6,mn,t;
    scanf("%d%d",&n,&m);
    int a[n+20][m+20];
    memset(a,0,sizeof a);
    for(i=1;i<=n;++i){
        for(j=1;j<=m;++j)scanf("%d",a[i]+j),a[i][j]+=a[i-1][j]+a[i][j-1]-a[i-1][j-1];
    }
    for(i=1;i<=n;++i){
        for(j=i;j<=n;++j){
            mn=1e6;
            for(k=1;k<=m;++k){
                t=2*(a[j][k-1]-a[i-1][k-1])-(j-i+1)*k;
                if(mn>t)mn=t;
                t=a[n][m]+(j-i+1)*(k+1)-2*(a[j][k]-a[i-1][k])+mn;
                if(ans>t)ans=t;
            }
        }
    }
    printf("%d",ans);
    return 0;
}

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