P1563 [NOIP2016 提高组] 玩具谜题

#include <bits/stdc++.h>
using namespace std;
//逆时针
int trans0(int pp[], string data[], int raw, int m, int a, int b){
    if(raw+b<m){
            return raw+b;
        }
        else {
            return trans0(pp,data,0,m,a,b-m+raw);
        }
}
//顺时针
int trans1(int pp[], string data[], int raw, int m, int a, int b){
    if(raw-b>=0){
            return raw-b;
        }
        else {
            return trans1(pp,data,m-1,m,a,b-raw-1);
        }
}

int trans(int pp[], string data[], int raw, int m, int a, int b)
{   
    if(pp[raw]!=a){
        if(raw+b<m){
            return raw+b;
        }
        else {
            return trans0(pp,data,0,m,a,b-m+raw);
        }
    }
    if(pp[raw]==a){
        if(raw-b>=0){
            return raw-b;
        }
        else {
            return trans1(pp,data,m-1,m,a,b-raw-1);
        }
    }
} 

int main()
{
    int n, m, raw = 0;
    int a, b;
    cin >> n >> m;
//测试数据大，避免RE
    int pposition[20000000];

    string data[1000000];
     for (int i = 0; i < n; i++)
    {
        cin >> pposition[i] >> data[i];
    }

    for (int i = 0; i < m; i++)
    {
        cin >> a >> b;
        if(i==8){
        }
        raw = trans(pposition, data, raw, n, a, b);
    }
    cout << data[raw];
}