【NOIP2016提高组 day1】玩具谜题
题解:
这是一道模拟题,不过呢大家可以取一下巧的如果当前发现与目标的方向一致就继续,否则就反向
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,flag,ans,bs,fx;
struct oo{
int fx;
string name;
}peo[100010];
string name;
ll read(){
ll num=0,f=1;
char ch=getchar();
while(ch>'9'||ch<'0'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
num=(num<<3)+(num<<1)+ch-'0';
ch=getchar();
}
return num;
}
int main(){
n=read();
m=read();
for(int i=1;i<=n;i++){
fx=read();
cin>>name;
peo[i].name=name;
peo[i].fx=fx;
}
ans=1;
for(int i=1;i<=m;i++){
fx=read();
bs=read();
if(abs(peo[ans].fx-fx))
ans+=bs;
else ans-=bs;
while(ans<=0) ans+=n;
while(ans>n) ans-=n;
}
cout<<peo[ans].name;
return 0;
}