P1563 NOIP2016 提高组 玩具谜题

#include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i = (int)l;i <= (int)r;i++)
#define per(i,r,l) for(int i = (int)r;i >= (int)l;i--)
#define pb push_back
#define all(a) a.begin(),a.end()
#define fi first
#define se second
#define mp make_pair
#define SZ(a) (int)(a.size())
typedef vector<int> VI;
typedef pair<int,int> PII;
typedef long long ll;
typedef double db;

const int N = 1e5 + 10,INF = 1e9,mod = INF + 7;
int n, m;
bool f[N];
string s[N];

int main()
{
	scanf("%d %d", &n, &m);
	rep(i,1,n)
		cin >> f[i] >> s[i];
	int now = 1;
	while(m--){
		bool opt;
		int x;
		scanf("%d %d", &opt, &x);
		opt ^= f[now];
		now += (opt ? x : -x);
		if(now <= 0) now += n;
		if(now > n)now -= n;
	}
	cout << s[now] << endl;
	return 0;
}

这道题，其他网站都过了，就luogu 全WA???