baekjun 7569. 토마토2

 bfs 3차원배열

#include <iostream>
#include <algorithm>
#include <list>
#include <vector>
using namespace std;
 
int M, N, H;
int box[101][101][101];
int visitedList[101][101][101];
 
/*
0 : raw tomato
-1 : empty
1 : cooked tomato
*/
int main(){
    int rawCnt = 0;
    list<vector<int>> que;
    cin >> M >> N >> H;
    for(int h = 1; h <= H; h++){
        for(int i = 1; i <= N; i++)
            for(int j = 1; j <= M; j++){
                cin >> box[h][i][j];
                if(box[h][i][j] == 1){
                    vector<int> tmp = {h, i, j};
                    que.push_front(tmp);
                    visitedList[h][i][j] = 1;
                } else if(box[h][i][j] == 0){
                    visitedList[h][i][j] = 0;
                    rawCnt++;
                } else {
                    visitedList[h][i][j] = -1;
                }
            }
    }
    int day = 0;
    while(rawCnt){
        day++;
        list<vector<int>> buf;
        if(que.empty()){
            cout << -1;
            return 0;
        }
        while(!que.empty()){
            vector<int> ret = que.back();
            int h = ret[0],i = ret[1], j=ret[2];
            que.pop_back();
            if(h - 1 >0){
                if(visitedList[h-1][i][j] == 0){
                    rawCnt--;
                    buf.push_back({h-1, i, j});
                    visitedList[h-1][i][j] = 1;
                }
            }
            if(h +1 <=H){
                if(visitedList[h+1][i][j] == 0){
                    rawCnt--;
                    buf.push_back({h+1, i, j});
                    visitedList[h+1][i][j] = 1;
                }
            }
            if(i-1 > 0){
                if(visitedList[h][i-1][j] == 0){
                    rawCnt--;
                    buf.push_back({h, i-1, j});
                    visitedList[h][i-1][j] = 1;
                }
            }
            if(i + 1 <= N){
                if(visitedList[h][i+1][j] == 0){
                    rawCnt--;
                    buf.push_back({h, i+1, j});
                    visitedList[h][i+1][j] = 1;
                }
            }
            if(j-1 > 0){
                if(visitedList[h][i][j-1] == 0){
                    rawCnt--;
                    buf.push_back({h, i, j-1});
                    visitedList[h][i][j-1] = 1;
                }
            }
            if(j+1 <= M){
                if(visitedList[h][i][j+1] == 0){
                    rawCnt--;
                    buf.push_back({h, i, j+1});
                    visitedList[h][i][j+1] = 1;
                }
            }
        }
        que = buf;
    }
 
    cout << day;
    return 0;
}