baekjoon 7569:토마토 (3차원)

baekjoon 7569 토마토

7576번 토마토

접근

7576토마토의 3차원 버전이다.
원소 3개짜리 자료형을 queue에 넣기 위해 tuple이라는 것을 사용했다.
원소값 불러오는 방식이 pair에 비해 좀 다르다는 것 빼면 큰 차이 없다.

코드

#include <iostream>
#include <vector>
#include <queue>
#include <tuple>
using namespace std;
int nearbfs(vector<vector<vector<int>>>& graph, tuple<int, int, int> curr, queue<tuple<int, int, int>>& q);
int main(){
  ios::sync_with_stdio(false);
  cin.tie(0); cout.tie(0);
  int m, n, h;
  cin >> m >> n >> h;
  vector<vector<vector<int>>> graph(h, vector<vector<int>>(n, vector<int>(m)));
  queue<tuple<int, int, int>> q;
  int count = 0;
  for(int k = 0; k < h; k++){
    for(int i = 0; i < n; i++){
      for(int j = 0; j < m; j++){
        int temp;
        cin >> temp;
        graph[k][i][j] = temp;
        if(temp >= 0){
          count++;
          if (temp == 1){
            q.push(make_tuple(k, i, j));
          }
        }
      }
    }
  }
  
  int result = q.size();
  int level = 0;
  while(!q.empty() && result < count){
    int qsize = q.size();
    for(int i = 0; i < qsize; i++){
      tuple<int, int, int> curr = q.front();
      q.pop();
      result += nearbfs(graph, curr, q);
    }
    level++;
    // cout << result << "\n";
    // for(int k = 0; k < h; k++){
    //   cout << k << "층\n";
    //   for(int i = 0; i < n; i++){
    //     for(int j = 0; j < m; j++){
    //       cout << graph[k][i][j];
    //     }
    //     cout << "\n";
    //   }
    //   cout << "--------------\n";
    // }
  }
  if(result < count){
    cout << -1;
  }
  else if (result == count){
    cout << level;
  }




  return 0;
}
int nearbfs(vector<vector<vector<int>>>& graph, tuple<int, int, int> curr, queue<tuple<int, int, int>>& q){
  int changeCount = 0;
  if(get<0>(curr) - 1 >= 0 && graph[get<0>(curr) - 1][get<1>(curr)][get<2>(curr)] == 0){
    q.push(make_tuple(get<0>(curr) - 1, get<1>(curr), get<2>(curr)));
    graph[get<0>(curr) - 1][get<1>(curr)][get<2>(curr)] = 1;
    changeCount++;
  }
  if(get<1>(curr) - 1 >= 0 && graph[get<0>(curr)][get<1>(curr)-1][get<2>(curr)] == 0){
    q.push(make_tuple(get<0>(curr), get<1>(curr)-1, get<2>(curr)));
    graph[get<0>(curr)][get<1>(curr)-1][get<2>(curr)] = 1;
    changeCount++;
  }
  if(get<2>(curr) - 1 >= 0 && graph[get<0>(curr)][get<1>(curr)][get<2>(curr)-1] == 0){
    q.push(make_tuple(get<0>(curr), get<1>(curr), get<2>(curr)-1));
    graph[get<0>(curr)][get<1>(curr)][get<2>(curr)-1] = 1;
    changeCount++;
  }
  if(get<2>(curr) + 1 < graph[0][0].size() && graph[get<0>(curr)][get<1>(curr)][get<2>(curr)+1] == 0){
    q.push(make_tuple(get<0>(curr), get<1>(curr), get<2>(curr)+1));
    graph[get<0>(curr)][get<1>(curr)][get<2>(curr)+1] = 1;
    changeCount++;
  }
  if(get<1>(curr) + 1 < graph[0].size() && graph[get<0>(curr)][get<1>(curr)+1][get<2>(curr)] == 0){
    q.push(make_tuple(get<0>(curr), get<1>(curr)+1, get<2>(curr)));
    graph[get<0>(curr)][get<1>(curr)+1][get<2>(curr)] = 1;
    changeCount++;
  }
  if(get<0>(curr) + 1 < graph.size() && graph[get<0>(curr)+1][get<1>(curr)][get<2>(curr)] == 0){
    q.push(make_tuple(get<0>(curr)+1, get<1>(curr), get<2>(curr)));
    graph[get<0>(curr)+1][get<1>(curr)][get<2>(curr)] = 1;
    changeCount++;
  }
  return changeCount;
}

배운 점

tuple 사용법 배웠다.