Pagini recente » Cod sursa (job #2613760) | Cod sursa (job #2676279) | Cod sursa (job #3220175) | Cod sursa (job #2140281) | Cod sursa (job #1326148)
#include <iostream>
#include<fstream>
#define nmax 300001
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
long int n, m, x, y,parent[nmax], level[nmax];
void explore(int x)
{ if(level[x]) return;
explore(parent[x]);
level[x]=level[parent[x]]+1;
}
int main()
{ f>>n>>m;
for(int i=1; i<=n; i++) {f>>parent[i]; if (parent[i]==0) level[i]=i; }
level[1]=1;
for(int i=1; i<=n; i++) explore(i);
int aux;
for(int i=1; i<=m; i++)
{ f>>x>>y;
if(y==1) g<<parent[x]<<"\n";
else {while(y>1) {level[x]--; y--; } g<<parent[level[x-1]]<<"\n";}}
return 0;
}