【NOIP2016】玩具谜题 模拟

#include
#include
#include
#include
using namespace std;
struct node{string s;int opt;}a[1010000];
int n,m,now;
int main() {
    scanf("%d%d",&n,&m);
    for (int i=0;i>a[i].opt>>a[i].s;
    for (int i=1;i<=m;i++) {
        int turn,x;
        scanf("%d%d",&turn,&x);
        if (a[now].opt^turn) now=(now+x)%n;
        else now=(now-x);
        if (now<0) now+=n;		
    }
    cout<