백준 20208번 진우의 민트초코우유 C++

https://www.acmicpc.net/problem/20208

20208번: 진우의 민트초코우유

 

bfs, 어떤 위치의 우유를 먹었는지는 비트를 통해 판별

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

struct Info {
    int row;
    int col;
    int health;
    int mint;
    int cnt;
};

int dRow[4] = { -1,0,1,0 };
int dCol[4] = { 0,1,0,-1 };

int n, m, h;
int check = 1;
vector<vector<int>> board;
vector<vector<vector<bool>>> found;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> m >> h;
    board = vector<vector<int>>(n, vector<int>(n));
    found = vector<vector<vector<bool>>>(n, vector<vector<bool>>(n, vector<bool>(1024, false)));
    queue<Info> q;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> board[i][j];
            if (board[i][j] == 1) {
                found[i][j][0] = true;
                q.push({ i,j,m,0,0 });
                board[i][j] = -1;
            }
            if (board[i][j] == 2) {
                board[i][j] = check;
                check <<= 1;
            }
        }
    }
    int ans = 0;
    while (!q.empty()) {
        auto curr = q.front();
        q.pop();
        if (board[curr.row][curr.col] == -1) {
            ans = max(ans, curr.cnt);
        }
        if (curr.health == 0) continue;
        for (int i = 0; i < 4; i++) {
            int nextRow = curr.row + dRow[i];
            int nextCol = curr.col + dCol[i];
            int nextHealh = curr.health - 1;
            int nextMint = curr.mint;
            int nextCnt = curr.cnt;
            if (nextRow < 0 || nextRow >= n) continue;
            if (nextCol < 0 || nextCol >= n) continue;
            if (board[nextRow][nextCol] > 0) {
                if ((nextMint & board[nextRow][nextCol]) == 0) {
                    nextMint += board[nextRow][nextCol];
                    nextCnt++;
                    nextHealh += h;
                }
            }
            if (found[nextRow][nextCol][nextMint]) continue;
            found[nextRow][nextCol][nextMint] = true;
            q.push({ nextRow,nextCol,nextHealh,nextMint,nextCnt });
        }
    }
    cout << ans;
}