백준 14248번 점프 점프 C++

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

14248번: 점프 점프

 

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, s;

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];
    }
    cin >> s;
    s -= 1;
    queue<int> q;
    found[s] = true;
    int ans = 1;
    q.push(s);
    while (!q.empty()) {
        int curr = q.front();
        q.pop();
        int left = curr - v[curr];
        int right = curr + v[curr];
        if (left >= 0) {
            if (found[left] == false) {
                found[left] = true;
                ans++;
                q.push(left);
            }
        }
        if (right < n) {
            if (found[right] == false) {
                found[right] = true;
                ans++;
                q.push(right);
            }
        }
    }
    cout << ans;
}