noip2016题解

没有正解，都是我的暴力

T1玩具谜题

模拟

// luogu-judger-enable-o2
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 100005
using namespace std;

int n,m;

int now;

struct P
{
    int s;char name[12];
}a[N];

int main()
{
    scanf("%d%d",&n,&m);now=1;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i].s);
        cin>>a[i].name;
    }
    for(int i=1;i<=m;i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        if(x==0)
        {
            if(a[now].s==0)
            {
                now-=y;
                while(now<=0) now+=n;
            }else
            {
                now+=y;
                while(now>n) now-=n;
            }
        }
        if(x==1)
        {
            if(a[now].s==1)
            {
                now-=y;
                while(now<=0) now+=n;
            }else
            {
                now+=y;
                while(now>n) now-=n;
            }
        }
    }
    cout<<a[now].name<<endl;
    return 0;
}

View Code