Pagini recente » Cod sursa (job #229435) | Cod sursa (job #580744) | Cod sursa (job #2218570) | Cod sursa (job #2713670) | Cod sursa (job #1697095)
#include <fstream>
#include <vector>
#define NM 300005
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
vector <int> G[NM];
int M[NM][50], n, m;
bool Valid[NM];
void DFS(int x, int lv, int pre)
{
int i, c=1, p;
M[x][0]=pre;
for (i=2; i<=lv; i=i*2)
{
M[x][c]=M[M[x][c-1]][c-1];
c++;
}
int sz=G[x].size();
for (i=0; i<sz; i++)
{
p=G[x][i];
DFS(p, lv+1, x);
}
}
int main()
{
int i, x, j, c, y;
fin>>n>>m;
for (i=1; i<=n; i++)
{
fin>>x;
G[x].push_back(i);
}
DFS(0, 0, 0);
for (i=1; i<=m; i++)
{
fin>>x>>y;
c=0;
if (y>n)
{
fout<<0<<'\n';
continue;
}
while (y>0)
{
if (y%2==1)
{
x=M[x][c];
}
c++;
y=y/2;
}
fout<<x<<'\n';
}
return 0;
}