NOIP2016 T1 玩具谜题

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<iomanip>
#include<queue>
using namespace std;
char name[100010][12];int n,m,s[100010],x,y,p;
int main()
{

//freopen("lx.in","r",stdin);

scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)
{
scanf("%d",&s[i]);
scanf("%s",name[i]);
}

for(int i=1;i<=m;i++)
{
scanf("%d%d",&x,&y);
if(x+s[p]==1)
p=(p+y)%n;
else
{
p=p-y;
while(p<0)
p+=n;
}
}
printf("%s",name[p]);
return 0;
}