Pagini recente » Cod sursa (job #3184102) | Cod sursa (job #1300005) | Cod sursa (job #2863215) | Cod sursa (job #220216) | Cod sursa (job #664822)
Cod sursa(job #664822)
#include<stdio.h>
#include<fstream>
#define maxn 250010
using namespace std;
int tati[maxn];
int stiva[maxn];
int vf;
int n,m;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
int main()
{
int a,b,cnt,nod,val,x;
in>>n>>m;
for(int i=1;i<=n;i++)
{
in>>tati[i];
}
for(int i=1;i<=m;i++)
{
in>>nod>>val;
cnt=0;
stiva[++vf]=nod;
while(1!=0)
{
nod=stiva[vf--];
if(cnt==val) {out<<nod<<"\n";break;}
else
{
cnt++;
if(tati[nod]==0) {out<<"0\n";break;}
else {stiva[++vf]=tati[nod];}
}
}
//dfs(a,0,b);
}
}