#include<bits/stdc++.h>
using namespace std;
struct student
{
int way;
string name;
};
struct order
{
int toward;
int p;
};
int main()
{
int num=1;
long long n;
long long m;
cin>>n>>m;
student *a=new student[n+1];
order *s=new order[m+1];
for(int i=1;i<=n;i++)
{
cin>>a[i].way>>a[i].name;
}
for(int j=1;j<=m;j++)
{
cin>>s[j].toward>>s[j].p;
s[j].p=s[j].p%n;
if(a[j].way==0&&s[j].toward==0)
{
num=(num+n-s[j].p)%n;
}
else if(a[j].way==0&&s[j].toward==1)
{
num=(num+s[j].p)%n;
}
else if(a[j].way==1&&s[j].toward==0)
{
num=(num+s[j].p)%n;
}
else if(a[j].way==1&&s[j].toward==1)
{
num=(num+n-s[j].p)%n;
}
}
cout<<a[num].name;
delete[] s;
delete[] a;
return 0;
}
```感觉没错啊,但是全wa了