0pts求调

#include <bits/stdc++.h>
using namespace std;
int n, a1, b1;
int a[1000000];
int vis[1000000];

struct node {
	int e;
	int sum;
};

int main() {
	cin >> n >> a1 >> b1;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	queue<node>q;
	bool woshishabi;
	q.push({a1, 0});
	while (!q.empty()) {
		node t = q.front();
		cout << t.e << " " << t.sum << endl;
		q.pop();
		if (t.e == b1) {
			cout << t.sum;
			//cout << "woshidashabi";
			woshishabi = 1;
			return 0;
		}
		if (t.e+a[t.e] <= b1 && vis[t.e+a[t.e]] == 0) {
			vis[t.e+a[t.e]] = 1;
			q.push ({t.e+a[t.e], t.sum + 1});
		}
		if (t.e-a[t.e] > 0 && vis[t.e-a[t.e]] == 0) {
			vis[t.e-a[t.e]] = 1;
			q.push ({t.e+a[t.e], t.sum + 1});
		}
	}

	cout << 0;
	return 0;
}