Pagini recente » Cod sursa (job #134280) | Cod sursa (job #2766099) | Cod sursa (job #1088794) | Cod sursa (job #2093130) | Cod sursa (job #2666441)
#include <bits/stdc++.h>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
const int lim=25e4+3;
int tree[19][lim];
int lg[lim];
int main()
{
int n,q,p,x;
in>>n>>q;
for(int i=1;i<=n;++i)
in>>tree[0][i];
for(int i=2;i<=n;++i)
lg[i]=lg[i/2]+1;
for(int p=1;p<=lg[n];++p)
for(int i=1;i<=n;++i)
tree[p][i]=tree[p-1][tree[p-1][i]];
while(q--)
{
in>>x>>p;
while(x and p)
{
x=tree[lg[p]][x];
p-=(1<<lg[p]);
}
out<<x<<'\n';
}
return 0;
}