题目分析
先吐吐槽,CCF今年666,先不说archer,mengbier是什么情况。。。mogician是要让我的程序不停+1s?
水题一道,如果没有1<=si<n这一个限制还需要取个模,所以不用膜了,直接模拟解决
源代码
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<cstdio>
#include<cmath>
#include<queue>
using namespace std;
inline const int Get_Int() {
int num=0,bj=1;
char x=getchar();
while(x<'0'||x>'9') {
if(x=='-')bj=-1;
x=getchar();
}
while(x>='0'&&x<='9') {
num=num*10+x-'0';
x=getchar();
}
return num*bj;
}
struct Toy {
int Face;
string name;
} a[100005];
int n,m;
int main() {
ios::sync_with_stdio(false);
cin>>n>>m;
for(int i=1; i<=n; i++)cin>>a[i].Face>>a[i].name;
int Now=1;
for(int i=1; i<=m; i++) {
int Direct,Num;
cin>>Direct>>Num;
Num%=n;
if(a[Now].Face==Direct)Now-=Num;
else Now+=Num;
if(Now<1)Now+=n;
if(Now>n)Now-=n;
}
cout<<a[Now].name<<endl;
return 0;
}