【noip系列——模拟】玩具谜题

P1563 玩具谜题

noip2016day1T1

去年做只有85分，于是给我幼小的心灵留下了巨大的创伤QAQ一直没有改

然而刚刚发现真*签到题qwq

因为它好歹也是noip真题啊所以贴一贴代码啦qwq

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
const int sz = 100010;
int n, m;
int fang, sum;
struct node {
    int dir;
    string name;
}p[sz];
string ans;
int main() {
    scanf("%d%d",&n,&m);
    for(int i = 1; i <= n;  i++) {
        scanf("%d",&p[i].dir);
        cin>>p[i].name;
    }
    int now = 1;
    for(int j = 1; j <= m; j++) {
        scanf("%d%d",&fang,&sum);
        if(fang == p[now].dir) { //顺时针 
            if(now > sum) now -= sum;
            else if(now == sum) now = n;
            else {
                sum = sum - now;
                now = n - sum;
            } 
        }
        else {  //逆时针 
            if(now + sum <= n) now += sum;
            else {
                sum = sum - n + now;
                now = sum;
            }
            
        }
    }
    cout<<p[now].name;
    return 0;
}