Pagini recente » Cod sursa (job #2976621) | Cod sursa (job #2894199) | Cod sursa (job #2375020) | Cod sursa (job #1327332) | Cod sursa (job #1112195)
#include <cstdio>
#include <vector>
using namespace std;
int stra[20][250001];
int pn;
vector <int> gr[250001];
void dfs(int vf)
{
int p2=0,nod=stra[0][vf],i;
while(stra[p2][nod])
{
stra[p2+1][vf]=stra[p2][nod];
nod=stra[p2][nod];
p2++;
}
for(i=0;i<gr[vf].size();i++)
dfs(gr[vf][i]);
}
int cauta(int x, int p)
{
int p2=pn,mij;
if(p>(1<<(pn+1)))
return 0;
while(p&&x)
{
if((1<<p2)<=p)
{
x=stra[p2][x];
p-=(1<<p2);
}
else
p2--;
}
if(x)
return x;
return 0;
}
int main()
{
int n,m;
int i;
int x,p;
freopen("stramosi.in","r",stdin);
scanf("%d %d\n",&n,&m);
for(i=1;i<=n;i++)
{
scanf("%d ",&stra[0][i]);
gr[stra[0][i]].push_back(i);
}
dfs(0);
while((1<<pn)<n)
pn++;
pn--;
freopen("stramosi.out","w",stdout);
for(i=0;i<m;i++)
{
scanf("%d %d\n",&x,&p);
printf("%d\n",cauta(x,p));
}
fclose(stdin);
fclose(stdout);
return 0;
}