P1563 [NOIP2016 提高组] 玩具谜题

1.通过1和-1来记录状态向左或者向右

 

#include <bits/stdc++.h>
using namespace std;
int a[10005];
string s[10005];
int main() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> s[i];
        if (a[i] == 0)
            a[i] = -1;
        else
            a[i] = 1;
    }
    int cnt = 0;
    while (m--) {
        int x = 0, y = 0;
        cin >> x >> y;
        if (x == 0)
            x = -1;
        cnt += a[cnt] * x * y;
        cnt = (cnt + n) % n;
    }
    cout << s[cnt];
    return 0;
}