奇怪的电梯题解

奇怪的电梯题解

题面：奇怪的电梯
这是一个BFS裸题
只要用BFS，再根据题目模拟就行了

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 1048586
#define M 5005
#define N 500005
#define lowbit(x) ((x)&(-(x)))
#define debug(...) cout << '[' << 'D' << 'E' << ']' << ' ' << __LINE__ << ':' << __VA_ARGS__ << endl;
#define vl(x) #x << '(' << x << ')'
#define mod 998244353
#define who(s,limit,tpe) s + tpe , s + limit + tpe
#define all(s) s.begin(),s.end()
#define s_(s) s.size()
#define memset2(a,x,n,change) for(int i = x ; i <= n ; i ++) a[i] = change;
#define Mn(a,b,c) min(a,min(b,c))
#define Mx(a,b,c) max(a,max(b,c))
#define e9 1000000000
int a[N];
string s;
vector<int> G[N];
template<class T>
bool comp(T a,T b ,T c){return a == b && b == c;}
int dis[N], vis[N];
queue<int> q;
int n,m,k;
void solve(int u,int v){
    if (v >= 1 && v <= n && !vis[v]){
        dis[v] = dis[u] + 1;
        q.push(v);
        vis[v] = 1;
    }
}
void BFS() {
    q.push(m);
    memset(dis,-1,sizeof(dis));
    dis[m] = 0;
    vis[m] = 1;
    while (!q.empty()) {
        int now = q.front();
        q.pop();
        if (now == k) return ;
        solve(now,now - a[now]);
        solve(now,now + a[now]);
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) cin >> a[i];
    BFS();
    cout << dis[k] << endl;
    return 0;
}