백준 11060번 점프 점프 C++

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

11060번: 점프 점프

 

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;

int n;
vector<int> v;
vector<bool> found;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    cin >> n;
    v = vector<int>(n);
    found = vector<bool>(n, false);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    queue<pair<int, int>> q;
    q.push({ 0,0 });
    found[0] = true;
    int ans = -1;
    while (!q.empty()) {
        auto curr = q.front();
        q.pop();
        if (curr.first == v.size() - 1) {
            ans = curr.second;
            break;
        }
        for (int i = 1; i <= v[curr.first]; i++) {
            int next = curr.first + i;
            if (next >= v.size()) break;
            if (found[next]) continue;
            q.push({ next,curr.second + 1 });
            found[next] = true;
        }
    }
    cout << ans;
}