제출 #13153

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
13153		paulsohn	과수원 (NOI14_orchard)	C++98	0 / 25	0 ms	262144 KiB

orchard

#include<stdio.h>
#include<algorithm>
using namespace std;
int n, m, V[1000100], sum[1000100], dy[120000000];
inline int access(int i, int j){ return (m+1)*i+j;}
inline int access(int i, int ii, int j){ return (m+1)*((n+1)*i+ii)+j; }
int main(){
    int i,ii,j,tmp,tot=0,wei=50000000;
    scanf("%d %d",&n,&m);
    for(i=1;i<=n;++i){
        for(j=1;j<=m;++j){
            scanf("%d",&tmp);
            if(tmp){
                ++tot;
                V[access(i,j)]=-1;
            }
            else V[access(i,j)]=1;
            sum[access(i,j)]=V[access(i,j)]+sum[access(i-1,j)];
        }
    }
    for(i=0;i<n;++i){
        for(ii=i+1;ii<=n;++ii){
            for(j=1;j<=m;++j){
                dy[access(i,ii,j)]=sum[access(ii,j)]-sum[access(i,j)]+min(dy[access(i,ii,j-1)],0);
                wei=min(wei,dy[access(i,ii,j)]);
            }
        }
    }
    printf("%d\n",tot+wei);
    return 0;
}

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