백준 11909번 배열 탈출 C++

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

11909번: 배열 탈출

 

우선순위 큐를 이용해서 다익스트라 알고리즘을 적용해서 해결하였다.

 

#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;

int n;
int dRow[2] = { 0,1 };
int dCol[2] = { 1,0 };
vector<vector<int>> board;
vector<vector<int>> push;

struct Info {
    int row;
    int col;
    int val;
    int pushCnt;

    bool operator<(const Info& other) const {
        return pushCnt < other.pushCnt;
    }
    bool operator>(const Info& other) const {
        return pushCnt > other.pushCnt;
    }
};

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

    priority_queue<Info, vector<Info>, greater<Info>> pq;
    cin >> n;
    board = vector<vector<int>>(n, vector<int>(n));
    push = vector<vector<int>>(n, vector<int>(n, 987654321));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> board[i][j];
        }
    }
    pq.push({ 0,0,board[0][0],0 });
    push[0][0] = 0;
    int ans = -1;
    while (!pq.empty()) {
        auto curr = pq.top();
        pq.pop();
        if (curr.row == n - 1 && curr.col == n - 1) {
            ans = curr.pushCnt;
            break;
        }
        for (int i = 0; i < 2; i++) {
            int nextRow = curr.row + dRow[i];
            int nextCol = curr.col + dCol[i];
            if (nextRow >= n || nextCol >= n) continue;
            int nextVal = board[nextRow][nextCol];
            int nextPushCnt = curr.pushCnt;
            if (curr.val <= nextVal) {
                nextPushCnt += nextVal - curr.val + 1;
            }
            if (nextPushCnt >= push[nextRow][nextCol]) continue;
            pq.push({ nextRow,nextCol,nextVal,nextPushCnt });
            push[nextRow][nextCol] = nextPushCnt;
        }
    }
    cout << ans;
}