代码在下。。。 呜呜感激不尽┭┮﹏┭┮
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#define N 10025
using namespace std;
struct node{
int side;
string name;
}ltoy[N];
int main()
{
int m,n;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d%s",<oy[i].side,<oy[i].name);
for(int i=1;i<=n;i++){
ltoy[i+n].side=ltoy[i].side;
ltoy[i+n].name=ltoy[i].name;
}
int tmp=1;
for(int i=1;i<=m;i++){
int ai,Si;
scanf("%d%d",&ai,&Si);
if(ltoy[tmp].side==0&&ai==0) tmp=(tmp+n-Si)%n;
else if(ltoy[tmp].side==0&&ai==1)tmp=(tmp+Si)%n;
else if(ltoy[tmp].side==1&&ai==0)tmp=(tmp+Si)%n;
else if(ltoy[tmp].side==1&&ai==1)tmp=(tmp+n-Si)%n;
}
cout<<ltoy[tmp].name<<endl;
return 0;
}