美妙35分 深感疑惑求帮助 自认绕圈处理没问题

#include <bits/stdc++.h>
using namespace std;
int n,m,a,s;
struct node{
	string name;
	int turn;
}t[100005];
int main(){
	cin >> n >> m;
	for(int i = 1;i <= n; i++){
		cin >> t[i].turn >> t[i].name;
	}
	int cmp = 1;
	for(int i = 1;i <= m; i++){
		cin >> a >> s;
		if((a == 0&&t[i].turn == 0)||(a == 1&&t[i].turn == 1)){
			int p = s+cmp;
			if(p > n)
				p -= n;
			cmp = p;
		}
		else{
			int p = cmp-s;
			if(p < 0)
				p += n;
			cmp = p;
		}
	}
	cout << t[cmp].name;
	return 0;
}