백준 14923번 미로 탈출 C++

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

14923번: 미로 탈출

 

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 moveCnt;
    int useMagic;
};

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

int n, m;
int hr, hc, er, ec;
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 >> hr >> hc >> er >> ec;
    board = vector<vector<int>>(n + 1, vector<int>(m + 1));
    found = vector<vector<vector<bool>>>(n + 1, vector<vector<bool>>(m + 1, vector<bool>(2, false)));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> board[i][j];
        }
    }
    queue<Info> q;
    q.push({ hr,hc,0,0 });
    found[hr][hc][0] = true;
    int ans = -1;
    while (!q.empty()) {
        auto curr = q.front();
        q.pop();
        if (curr.row == er && curr.col == ec) {
            ans = curr.moveCnt;
            break;
        }
        for (int i = 0; i < 4; i++) {
            int nextRow = curr.row + dRow[i];
            int nextCol = curr.col + dCol[i];
            if (nextRow <= 0 || nextRow > n) continue;
            if (nextCol <= 0 || nextCol > m) continue;
            if (board[nextRow][nextCol] == 0) {
                if (found[nextRow][nextCol][curr.useMagic]) continue;
                found[nextRow][nextCol][curr.useMagic] = true;
                q.push({ nextRow,nextCol,curr.moveCnt + 1,curr.useMagic });
            }
            else {
                if (curr.useMagic == 1) continue;
                int nextUseMagic = 1;
                if (found[nextRow][nextCol][nextUseMagic]) continue;
                found[nextRow][nextCol][nextUseMagic] = true;
                q.push({ nextRow,nextCol,curr.moveCnt + 1,nextUseMagic });
            }
        }
    }
    cout << ans;
}