백준 13903번 출근 C++

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

13903번: 출근

 

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 r, c, n;
vector<int> dRow;
vector<int> dCol;
vector<vector<int>> board;
vector<vector<bool>> found;

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

    cin >> r >> c;
    board = vector<vector<int>>(r, vector<int>(c));
    found = vector<vector<bool>>(r, vector<bool>(c, false));
    for (int i = 0; i < r; i++) {
        for (int j = 0; j < c; j++) {
            cin >> board[i][j];
        }
    }
    cin >> n;
    dRow = vector<int>(n);
    dCol = vector<int>(n);
    for (int i = 0; i < n; i++) {
        cin >> dRow[i] >> dCol[i];
    }
    queue<Info> q;
    for (int i = 0; i < c; i++) {
        if (board[0][i] == 1) {
            q.push({ 0,i,0 });
            found[0][i] = true;
        }
    }
    int ans = -1;
    while (!q.empty()) {
        auto curr = q.front();
        q.pop();
        if (curr.row == r - 1) {
            ans = curr.moveCnt;
            break;
        }
        for (int i = 0; i < n; i++) {
            int nextRow = curr.row + dRow[i];
            int nextCol = curr.col + dCol[i];
            if (nextRow < 0 || nextRow >= r) continue;
            if (nextCol < 0 || nextCol >= c) continue;
            if (found[nextRow][nextCol]) continue;
            if (board[nextRow][nextCol] == 0) continue;
            found[nextRow][nextCol] = true;
            q.push({ nextRow,nextCol,curr.moveCnt + 1 });
        }
    }
    cout << ans;
}