题解 P1563 【玩具谜题】

· · 题解

话不多说 直接上代码 异或了解一下

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
typedef __int128 lll;
const int N=100000+1000;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
map< int,string>s;
bool a[N];
int main()
{
#ifdef DEBUG
    freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
#endif
    char str[20];

    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d %s",&k,str);
        a[i]=k;
        s[i]=str;
    }
    int pos=1;
    while(m--){
        scanf("%d %d",&k,&q);
        if(a[pos]^k){
            pos+=q;
        }else{
            pos-=q;
        }
        if(pos<=0){
            pos+=n;
        }
        if(pos>n){
            pos-=n;
        }
    }
    cout << s[pos] << endl;
    //cout << "Hello world!" << endl;
    return 0;
}