Pagini recente » Cod sursa (job #496819) | Cod sursa (job #1319719) | Cod sursa (job #1995254) | Cod sursa (job #1006643) | Cod sursa (job #1695303)
#include <stdio.h>
#include <vector>
using namespace std;
const int MAX = 250005;
int n, m, x, y, p[MAX];
vector<int> l[MAX];
int main(){
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++)
scanf("%d", &p[i]);
for(int i = 1; i <= n; i++){
int x = i;
while(x){
x = p[x];
l[i].push_back(x);
}
}
for(int i = 0; i < m; i++){
scanf("%d%d", &x, &y);
if(y > l[x].size() + 1)
printf("0\n");
else
printf("%d\n", l[x][y - 1]);
}
return 0;
}