Pagini recente » Cod sursa (job #1725291) | Cod sursa (job #1328104) | Cod sursa (job #2062204) | Cod sursa (job #798187) | Cod sursa (job #326577)
Cod sursa(job #326577)
#include<stdio.h>
#include<assert.h>
using namespace std;
long n,m;
long long v[251000],mat[300001][3];
void cauta(long long q,long long p,long i)
{
if(i==p)
{
if(p==1)
{
printf("%lld\n",v[q]);
}
else printf("%lld\n",q);
}
else
{
if(i==1)
{
if(v[q]!=0)cauta(v[v[q]],p,i+1);
else {printf("0\n");assert(cauta);}
}
else
{
if(q!=0)cauta(v[q],p,i+1);
else {printf("0\n");assert(cauta);}
}
}
}
int main()
{
long i;
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scanf("%ld%ld",&n,&m);
for(i=1;i<=n;i++)scanf("%lld",&v[i]);
for(i=1;i<=m;i++)
{
scanf("%lld",&mat[i][1]);
scanf("%lld",&mat[i][2]);
cauta(mat[i][1],mat[i][2],1);
}
return 0;
}