백준 : 7569

https://www.acmicpc.net/problem/7569

7569번: 토마토

#include<iostream>
#include<vector>
#include<queue>
 
using namespace std;
 
int M, N, H;
int tomato[100][100][100];
 
int MAX_value;
int current_value;
 
 
 
int dx[6] = { 0,0,1,0,-1,0 };
int dy[6] = { 0,0,0,-1,0,1 };
int dz[6] = { 1,-1,0 ,0,0, 0 };
struct TOMATO
{
    int y;
    int x;
    int z;
};
 
int result=1;
 
void BFS(int y, int x, int z,int current, queue<TOMATO>& q) {
    if (y >= N || x >= M || z >= H || y < 0 || x < 0 || z < 0) return;
 
    if (tomato[y][x][z] == 0){
        tomato[y][x][z] = current;
        q.push({ y,x,z });
        result = current;
        current_value++;
    }
}
 
 
int main(void) {
    cin >> M >> N >> H;
    
    MAX_value = M * N * H;
    current_value = 0;
 
    queue<TOMATO> q;
 
    for (int k = 0;k < H;k++) {
        for (int i = 0;i < N;i++) {
            for (int j = 0;j < M;j++) {
                cin >> tomato[i][j][k];
                if (tomato[i][j][k] == 1) {
                    current_value++;
                    
                    q.push({ i,j,k });
                }
                else if (tomato[i][j][k] == -1) {
                    MAX_value--;
                }
            }
        }
    }
 
    while (!q.empty()) {
        int x, y, z;
        x = q.front().x;
        y = q.front().y;
        z = q.front().z;
        for (int i = 0;i < 6;i++) {
            int xn = x + dx[i];
            int yn = y + dy[i];
            int zn = z + dz[i];
            BFS(yn, xn, zn, tomato[y][x][z] + 1,q);
        }
        q.pop();
 
    }
 
 
    if (MAX_value == current_value)
        cout << result-1<<endl;
    else
        cout << -1 << endl;
 
}