Pagini recente » Cod sursa (job #2465903) | Cod sursa (job #537286) | Cod sursa (job #2411705) | Cod sursa (job #2516011) | Cod sursa (job #3287402)
#include <fstream>
#include <vector>
#define nmax 250005
using namespace std;
ifstream cin("stramosi.in");
ofstream cout("stramosi.out");
int n,q,x,p,k,st[nmax],dr[nmax],rmq[18][nmax];
vector<int>v[nmax];
void dfs(int nod){
if(nod!=0)
st[nod]=++k;
for(auto i:v[nod])
dfs(i);
dr[nod]=++k;
}
int solve(){
for(int i=17;i>=0;i--)
if(p-(1<<i)>=0){
x=rmq[i][x];
p-=(1<<i);
}
return x;
}
int main()
{
cin>>n>>q;
for(int i=1;i<=n;i++){
cin>>x;
rmq[0][i]=x;
v[x].push_back(i);
}
dfs(0);
for(int i=1;(1<<i)<=n;i++)
for(int j=1;j<=n;j++)
rmq[i][j]=rmq[i-1][rmq[i-1][j]];
while(q--){
cin>>x>>p;
cout<<solve()<<'\n';
}
return 0;
}