Toy Story番外片

點擊即可觀看

#include<bits/stdc++.h>
#define re register
#define f(i, a, b) for(re int i = a; i <= b; i++)
using namespace std;

int n, m, a, s, now = 0;
struct node{
	string name;
	int head;
}edge[100001];

signed main(){
	cin >> n >> m;
	f(i, 0, n - 1) cin >> edge[i].head >> edge[i].name;
	f(i, 1, m){
		scanf("%d%d", &a, &s);
		if(edge[now].head == 0 && a == 0) now = (now + n - s) % n;//內 左
		else if(edge[now].head == 0 && a == 1) now = (now + s) % n;//內 右
		else if(edge[now].head == 1 && a == 0) now = (now + s) % n;//外 左
		else if(edge[now].head == 1 && a == 1) now = (now + n - s) % n;//外 右
	}
	cout << edge[now].name;
}