Algorithms/7569.cpp at main · horaeng1/Algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include <stdio.h>
#include <algorithm>
#include <queue>
using namespace std;
int box[102][102][102];
bool flag[102][102][102]={false};
bool nonZero = true;
bool zero = false;
int result=0;
int n, m, h;
queue <int> qx;
queue <int> qy;
queue <int> qz;
void infect(int x, int y, int z){
  if(!flag[x-1][y][z] and x>1 and box[x-1][y][z]!=-1){
    if(box[x-1][y][z]==0) box[x-1][y][z]=box[x][y][z]+1;
    else box[x-1][y][z]=min(box[x-1][y][z], box[x][y][z]+1);
    flag[x-1][y][z]=true;
    qx.push(x-1);
    qy.push(y);
    qz.push(z);
  }
  if(!flag[x][y-1][z] and y>1 and box[x][y-1][z]!=-1){
    if(box[x][y-1][z]==0) box[x][y-1][z]=box[x][y][z]+1;
    else box[x][y-1][z]=min(box[x][y-1][z], box[x][y][z]+1);
    flag[x][y-1][z]=true;
    qx.push(x);
    qy.push(y-1);
    qz.push(z);
  }
  if(!flag[x][y][z-1] and z>1 and box[x][y][z-1]!=-1){
    if(box[x][y][z-1]==0) box[x][y][z-1]=box[x][y][z]+1;
    else box[x][y][z-1]=min(box[x][y][z-1], box[x][y][z]+1);
    flag[x][y][z-1]=true;
    qx.push(x);
    qy.push(y);
    qz.push(z-1);
  }

  if(!flag[x+1][y][z] and x<n and box[x+1][y][z]!=-1){
    if(box[x+1][y][z]==0) box[x+1][y][z]=box[x][y][z]+1;
    else box[x+1][y][z]=min(box[x+1][y][z], box[x][y][z]+1);
    flag[x+1][y][z]=true;
    qx.push(x+1);
    qy.push(y);
    qz.push(z);
  }
  if(!flag[x][y+1][z] and y<m and box[x][y+1][z]!=-1){
    if(box[x][y+1][z]==0) box[x][y+1][z]=box[x][y][z]+1;
    else box[x][y+1][z]=min(box[x][y+1][z], box[x][y][z]+1);
    flag[x][y+1][z]=true;
    qx.push(x);
    qy.push(y+1);
    qz.push(z);
  }
  if(!flag[x][y][z+1] and z<h and box[x][y][z+1]!=-1){
    if(box[x][y][z+1]==0) box[x][y][z+1]=box[x][y][z]+1;
    else box[x][y][z+1]=min(box[x][y][z+1], box[x][y][z]+1);
    flag[x][y][z+1]=true;
    qx.push(x);
    qy.push(y);
    qz.push(z+1);
  }
}


int main() {

  //Please Enter Your Code Here
  scanf("%d %d %d", &n, &m, &h);
  int tmp;
  for(int i=1; i<=h; i++){
    for(int j=1; j<=m; j++){
      for(int k=1; k<=n; k++){
        scanf("%d", &box[k][j][i]);
        if(box[k][j][i]==1){
          qx.push(k);
          qy.push(j);
          qz.push(i);
          flag[k][j][i]=true;
        }
        else if(box[k][j][i]==0) nonZero=false;
      }
    }
  }
  int x,y,z;
  while(!qx.empty()){
    x=qx.front();
    qx.pop();
    y=qy.front();
    qy.pop();
    z=qz.front();
    qz.pop();
    infect(x,y,z);
  }

  for(int i=1; i<=h; i++){
    for(int j=1; j<=m; j++){
      for(int k=1; k<=n; k++){
        if(box[k][j][i]==0) zero=true;
        if(result<box[k][j][i]) result=box[k][j][i];
        // printf("%d ", box[k][j][i]);
      }
      // printf("     y=%d z=%d\n" ,j,i);
    }
  }
  if(nonZero) printf("0");
  else if(zero) printf("-1");
  else{
    printf("%d", result-1);
  }

  return 0;
}