模拟,没难度 ,全通过
#include <bits/stdc++.h>
//#define debug
using namespace std;
const int MM=100000;
int n,m;
int dir[MM];
string career[MM];
int command1[MM];
int command2[MM];
int main()
{
cin>>n>>m;
for(int i=0; i<n; i++){
cin >> dir[i];
cin >> career[i]; // 数据保证 dis递增
}
for(int i=0;i<m; i++){
cin >> command1[i];
cin >> command2[i];
}
int ans=0;
for(int i=0;i<m;i++){
//逆时针
//if( command1[i]==0 && dir[ans] ==1 || command1[i]==1 && dir[ans] ==0 )
if( command1[i] != dir [ans] )
ans = ( ans + command2[i] ) % n;
else
ans = ( ans - command2[i] + n ) % n;
}
cout << career[ans];
return 0;
}