Pagini recente » Cod sursa (job #1295450) | Cod sursa (job #2813779) | Cod sursa (job #2682900) | Cod sursa (job #3193913) | Cod sursa (job #3239945)
#include <fstream>
#include <vector>
#define nmax 250002
using namespace std;
ifstream cin("stramosi.in");
ofstream cout("stramosi.out");
int n,q,s,a,dp[nmax][20];
vector<int>v[nmax];
void dfs(int nod,int k){
for(auto i:v[nod]){
for(int j=2;j<=k;j++)
dp[i][j]=dp[nod][j-1];
dp[i][1]=nod;
dfs(i,k+1);
}
}
int main()
{
cin>>n>>q;
for(int i=1;i<=n;i++){
cin>>s;
v[s].push_back(i);
}
dfs(0,0);
while(q--){
cin>>a>>s;
cout<<dp[a][s]<<'\n';
}
return 0;
}