백준 BOJ 6593 C++ 상범 빌딩

#include <bits/stdc++.h>
using namespace std;

int l, r, c;
char board[32][32][32];
int dist[32][32][32];

int dz[] = {1, -1, 0, 0, 0, 0};
int dx[] = {0, 0, 1, -1, 0, 0};
int dy[] = {0, 0, 0, 0, 1, -1};

void solve() {
    queue<tuple<int, int, int>> q;
    memset(dist, -1, sizeof(dist));
    for (int z = 0; z < l; ++z) {
        for (int x = 0; x < r; ++x) {
            for (int y = 0; y < c; ++y) {
                cin >> board[z][x][y];
                if (board[z][x][y] == 'S') {
                    dist[z][x][y] = 0;
                    q.push({z, x, y});
                }
            }
        }
    }
    while (!q.empty()) {
        int z = get<0>(q.front());
        int x = get<1>(q.front());
        int y = get<2>(q.front());
        q.pop();
        for (int k = 0; k < 6; ++k) {
            int nz = z + dz[k];
            int nx = x + dx[k];
            int ny = y + dy[k];
            if (nz >= 0 && nz < l && nx >= 0 && nx < r && ny >= 0 && ny < c) {
                if (board[nz][nx][ny] != '#' && dist[nz][nx][ny] == -1) {
                    dist[nz][nx][ny] = dist[z][x][y] + 1;
                    if (board[nz][nx][ny] == 'E') {
                        cout << "Escaped in " << dist[nz][nx][ny] << " minute(s).\n";
                        return;
                    }
                    q.push({nz, nx, ny});
                }
            }
        }
    }
    cout << "Trapped!\n";
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    while (true) {
        cin >> l >> r >> c;
        if (l == 0 && r == 0 && c == 0) break;
        solve();
    }
    return 0;
}