只求NOIP D1T1稳过orz。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e5+4;
int n,m;
struct Node {
int w;
char s[14];
}a[N];
int main() {
scanf("%d%d",&n,&m);
for (register int i=0;i<n;++i) scanf("%d%s",&a[i].w,a[i].s);
int cur=0;
for (register int t=0;t<m;++t) {
int dir,dt;
scanf("%d%d",&dir,&dt);
cur=dir^a[cur].w?(cur+dt)%n:((cur-dt)%n+n)%n;
}
cout<<a[cur].s<<endl;
return 0;
}