BOJ 2636번 치즈

BOJ : https://www.acmicpc.net/problem/2636

github : https://github.com/junho0956/Algorithm/blob/master/2636/2636/%EC%86%8C%EC%8A%A4.cpp

 

제가 구현 실력이 부족한거겠지만

정올 초등부(3번) 수준이 이정도라니 정말 놀랐습니다ㅠㅠ

중간에 구멍이 뚫리면 공기와 만난다는 점만 고려해주셔서 구현해주시면 될 것 같습니다.

 

#include <iostream>
#include <queue>
using namespace std;
 
typedef pair<int, int> pii;
 
queue<pair<pii, int> > q;
queue<pii> delq;
int arr[101][101];
bool visit[101][101];
int my[4] = { -1,1,0,0 };
int mx[4] = { 0,0,1,-1 };
 
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
 
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> arr[i][j];
            if (arr[i][j]) q.push({ {i,j},0 });
        }
    }
 
    queue<pii> hole;
    hole.push({ 0,0 });
    while (!hole.empty()) {
        int y = hole.front().first;
        int x = hole.front().second;
        hole.pop();
 
        if (visit[y][x]) continue;
        visit[y][x] = true;
        arr[y][x] = 2;
 
        for (int i = 0; i < 4; i++) {
            int yy = y + my[i];
            int xx = x + mx[i];
            if (yy >= 0 && yy < n && xx >= 0 && xx < m && !visit[yy][xx] && !arr[yy][xx]) {
                hole.push({ yy,xx });
            }
        }
    }
 
    int time = 0;
    int ans;
    while (1) {
        bool finish = true;
        int cnt = 0;
 
        while (!q.empty()) {
            int y = q.front().first.first;
            int x = q.front().first.second;
            int intime = q.front().second;
 
            if (intime != time) break;
            q.pop();
 
            bool check = true;
            for (int i = 0; i < 4; i++) {
                int yy = y + my[i];
                int xx = x + mx[i];
                if (yy >= 0 && yy < n && xx>=0 && xx < m && arr[yy][xx] == 2) {
                    check = false;
                    break;
                }
            }
 
            if (!check) delq.push({ y,x });
            else q.push({ {y,x},time + 1 }), finish = false;
        }
 
        while (!delq.empty()) {
            int y = delq.front().first;
            int x = delq.front().second;
            delq.pop();
            arr[y][x] = 2;
            for (int i = 0; i < 4; i++) {
                int yy = y + my[i];
                int xx = x + mx[i];
                if (!arr[yy][xx]) hole.push({ yy,xx });
            }
            cnt++;
        }
 
        while (!hole.empty()) {
            int y = hole.front().first;
            int x = hole.front().second;
            hole.pop();
 
            if (visit[y][x]) continue;
            visit[y][x] = true;
            arr[y][x] = 2;
 
            for (int i = 0; i < 4; i++) {
                int yy = y + my[i];
                int xx = x + mx[i];
                if (!arr[yy][xx]) hole.push({ yy,xx });
            }
        }
 
        time++;
        if (finish) {
            ans = cnt;
            break;
        }
    }
 
    cout << time << " " << ans;
 
    return 0;
}