noip2016

1.很丑的toy(考场上打的真的丑

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<string>
using namespace std;
int n,m,k,l;
bool b[100010],q;
char s[100010][12];
int main()
{
    freopen ("toy.in","r",stdin);
    freopen ("toy.out","w",stdout);
    scanf("%d%d",&n,&m);
    //cout<<n<<m;
    for (int i=1;i<=n;++i)
        scanf("%d %s",&b[i],s[i]);
    l=1;
    for (int i=1;i<=m;++i)
    {
        scanf("%d%d",&q,&k);
        if (b[l])
        {
            if (q)
            {
                l-=k;
                if (l<1)
                l+=n;
            }
            if (!q)
            {
                l+=k;
                if (l>n)
                l-=n;
            }
        }
        else
        {
            if (q)
            {
                l+=k;
                if (l>n)
                l-=n;
            }
            if (!q)
            {
                l-=k;
                if (l<1)
                l+=n;
            }
        }
    }
    printf("%s",s[l]);
    return 0;
}