oj.uz

Submission #14269

# Submission time Handle Problem Language Result Execution time Memory
14269 2015-05-09T13:26:07 Z tjdals1865 토마토 (KOI13_tomato) C
0 / 16
 635 ms 8912 KB 
#include <stdio.h>

#include <stdlib.h>

int n,m,i,j,tomato[1001][1001],day=0,tomatocnt=0,rec[1001][1001],empty;
void input(){
   scanf("%d %d",&m,&n);
    for(i=0;i<n;i++){
        for(j=0;j<m;j++){
            scanf("%d",&tomato[i][j]);
            if(tomato[i][j]==-1) empty++;
            if(tomato[i][j]==1) tomatocnt++;
        }
    }
}
void process(){
    while(day<=(n*m-empty)){
        if(tomatocnt==n*m-empty) break;
        for(i=0;i<n;i++){
            for(j=0;j<m;j++){
                if(tomato[i][j]==1 && rec[i][j]!=(-1)*day-1){
                    if(tomato[i-1][j]==0 && i-1>=0){
                        tomatocnt++;
                        tomato[i-1][j]=1;
                        rec[i][j]=(-1)*day-1;
                    }
                     if(tomato[i][j-1]==0 && j-1>=0){
                        tomatocnt++;
                        tomato[i][j-1]=1;
                        rec[i][j]=(-1)*day-1;
                    }
                    if(tomato[i+1][j]==0 && i+1<n){
                        tomatocnt++;
                        tomato[i+1][j]=1;
                        rec[i][j]=(-1)*day-1;
                    }
                    if(tomato[i][j+1]==0 && j+1<m){
                        tomatocnt++;
                        tomato[i][j+1]=1;
                        rec[i][j]=(-1)*day-1;
                    }
                }
            }
        }
        day++;
    }
}
void output(){
    if(day==(n*m-empty+1)) printf("-1");
    else printf("%d",day);
}
int main(void){
    input();
    process();
    output();
    return 0;
}

Subtask #1
0.0 / 1.6

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 8912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 1.6

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 8912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 1.6

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 8912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 1.6

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 8912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 1.6

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 8912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 1.6

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8912 KB Output is correct
2 Incorrect 635 ms 8912 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 1.6

# Verdict Execution time Memory Grader output
1 Incorrect 270 ms 8912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 1.6

# Verdict Execution time Memory Grader output
1 Incorrect 143 ms 8912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 1.6

# Verdict Execution time Memory Grader output
1 Incorrect 206 ms 8912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0.0 / 1.6

# Verdict Execution time Memory Grader output
1 Incorrect 628 ms 8912 KB Output isn't correct
2 Halted 0 ms 0 KB -