Pagini recente » Cod sursa (job #1347241) | Cod sursa (job #250362) | Cod sursa (job #969023) | Borderou de evaluare (job #2078412) | Cod sursa (job #250666)
Cod sursa(job #250666)
#include<algorithm>
using namespace std;
int n,m,a[250001][1001];
void solve(){
int i,j,q,p;
scanf("%d%d",&n,&m);
for(i=1; i<=n; a[i][0]=1,++i)
scanf("%d",&a[i][1]);
for(i=1; i<=n; ++i)
if(a[i][1])
for(j=1; j<=a[a[i][1]][0]; ++j)
a[i][++a[i][0]]=a[a[i][1]][j];
for(i=1; i<=m; ++i){
scanf("%d%d",&q,&p);
printf("%d\n",a[q][p]);}}
int main(){
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
solve();
return 0;}