[백준] 7569 - 토마토(설명X)

#include <cstdio>
#include <queue>
#include <tuple>
using namespace std;
 
int arr[100][100][100]{ 0, };
int visited[100][100][100]{ 0, };
queue<tuple<int, int, int>> order;
 
int bfs(int sizeH, int sizeN, int sizeM, int nu) {
    int max = 1;
    while (!order.empty()) {
        tuple<int, int, int> now = order.front();
        order.pop();
        nu++;
        max = arr[get<0>(now)][get<1>(now)][get<2>(now)];
 
        if (get<0>(now) + 1 < sizeH && arr[get<0>(now) + 1][get<1>(now)][get<2>(now)] == 0) {
            order.push({ get<0>(now) + 1, get<1>(now), get<2>(now) });
            arr[get<0>(now) + 1][get<1>(now)][get<2>(now)] = arr[get<0>(now)][get<1>(now)][get<2>(now)] + 1;
        }
        if (get<0>(now) -1 >= 0 && arr[get<0>(now) - 1][get<1>(now)][get<2>(now)] == 0) {
            order.push({ get<0>(now) - 1, get<1>(now), get<2>(now) });
            arr[get<0>(now) - 1][get<1>(now)][get<2>(now)] = arr[get<0>(now)][get<1>(now)][get<2>(now)] + 1;
        }
        if (get<1>(now) + 1 < sizeN && arr[get<0>(now)][get<1>(now) + 1][get<2>(now)] == 0) {
            order.push({ get<0>(now), get<1>(now) + 1, get<2>(now) });
            arr[get<0>(now)][get<1>(now) + 1][get<2>(now)] = arr[get<0>(now)][get<1>(now)][get<2>(now)] + 1;
        }
        if (get<1>(now) - 1 >= 0 && arr[get<0>(now)][get<1>(now) - 1][get<2>(now)] == 0) {
            order.push({ get<0>(now), get<1>(now) - 1, get<2>(now) });
            arr[get<0>(now)][get<1>(now) - 1][get<2>(now)] = arr[get<0>(now)][get<1>(now)][get<2>(now)] + 1;
        }
        if (get<2>(now) + 1 < sizeM && arr[get<0>(now)][get<1>(now)][get<2>(now) + 1] == 0) {
            order.push({ get<0>(now), get<1>(now), get<2>(now) + 1 });
            arr[get<0>(now)][get<1>(now)][get<2>(now) + 1] = arr[get<0>(now)][get<1>(now)][get<2>(now)] + 1;
        }
        if (get<2>(now) - 1 >= 0 && arr[get<0>(now)][get<1>(now)][get<2>(now) - 1] == 0) {
            order.push({ get<0>(now), get<1>(now), get<2>(now) - 1 });
            arr[get<0>(now)][get<1>(now)][get<2>(now) - 1] = arr[get<0>(now)][get<1>(now)][get<2>(now)] + 1;
        }
    }
    return sizeH * sizeN * sizeM == nu ? max - 1 : -1;
}
 
int main() {
    int M, N, H, nu = 0;
    scanf("%d %d %d", &M, &N, &H);
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < N; j++) {
            for (int k = 0; k < M; k++) {
                scanf("%d", &arr[i][j][k]);
                switch (arr[i][j][k])
                {
                case -1:
                    nu++;
                    break;
                case 1:
                    order.push({ i,j,k });
                    break;
                }
            }
        }
    }
 
    printf("%d\n", bfs(H, N, M, nu));
}