oj.uz

답안 #13151

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
13151 2015-02-01T08:23:22 Z paulsohn 과수원 (NOI14_orchard) C++
12 / 25
 303 ms 204596 KB 
#include<stdio.h>
#include<algorithm>
using namespace std;
int n, m, V[160][2010], sum[160][2010], dy[160][160][2010];
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[i][j]=-1;
            }
            else V[i][j]=1;
            sum[i][j]=V[i][j]+sum[i-1][j];
        }
    }
    for(i=0;i<n;++i){
        for(ii=i+1;ii<=n;++ii){
            for(j=1;j<=m;++j){
                dy[i][ii][j]=sum[ii][j]-sum[i][j]+min(dy[i][ii][j-1],0);
                wei=min(wei,dy[i][ii][j]);
            }
        }
    }
    printf("%d\n",tot+wei);
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204596 KB Output is correct
2 Correct 0 ms 204596 KB Output is correct
3 Correct 0 ms 204596 KB Output is correct
4 Correct 0 ms 204596 KB Output is correct

Subtask #2
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204596 KB Output is correct
2 Correct 0 ms 204596 KB Output is correct
3 Correct 2 ms 204596 KB Output is correct

Subtask #3
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 204596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 204596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 204596 KB Output is correct
2 Correct 8 ms 204596 KB Output is correct
3 Correct 12 ms 204596 KB Output is correct

Subtask #6
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 303 ms 204596 KB Output isn't correct
2 Halted 0 ms 0 KB -