NOIP2016提高组day1试题 玩具谜题

Description

Solution

这是一道简单的模拟题，只要判断好方向，照着做就好了。

Code

#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1e5+5;
int a[maxn],n,m,i,t,j,k,l,x,y,z;
char s[maxn][20];
int main(){
freopen("toy.in","r",stdin);freopen("toy.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
scanf("%d %s",&a[i],s[i]+1);
x=1;
for (i=1;i<=m;i++){
scanf("%d%d",&y,&z);
if (a[x]!=y) x=(x+z-1)%n+1;
else{
x=(x-z+n)%n;
if (!x) x=n;
}
}
printf("%s\n",s[x]+1);
return 0;
}