Pagini recente » Cod sursa (job #1845365) | Cod sursa (job #1846811) | Cod sursa (job #1540243) | Cod sursa (job #1469599) | Cod sursa (job #365255)
Cod sursa(job #365255)
//#include<stdio.h>
#include<fstream>
using namespace std;
fstream f("stramosi.in",ios::in),g("stramosi.out",ios::out);
int n,m;
//int v[251000],mat[300001][3];
int v[251000],mat[3][300001];
int st[4][1000000],k=0;
void cauta(int q,int p,int i)
{
/*if(i==p)
{
//printf("%d\n",q);
g<<q<<"\n";
return;
}
else
{
if(q!=0)cauta(v[q],p,i+1);
else {g<<"0\n";return;}
}*/
k=1;
st[1][k]=q;
st[2][k]=p;
st[3][k]=i;
while(k>0)
{
if(st[3][k]==st[2][k])
{
g<<st[1][k]<<"\n";
//printf("%d\n",st[1][k]);
k=0;return;
}
else
{
if(st[1][k]!=0){k++;st[1][k]=v[st[1][k-1]];st[2][k]=st[2][k-1];st[3][k]=1+st[3][k-1];}
else {g<<"0\n";k=0;return;}
}
}
}
int main()
{
int i;
//freopen("stramosi.in","r",stdin);
//freopen("stramosi.out","w",stdout);
//scanf("%d%d",&n,&m);
f>>n>>m;
for(i=1;i<=n;i++)/*scanf("%d",&v[i]);*/f>>v[i];
for(i=1;i<=m;i++)
{
//scanf("%d",&mat[i][1]);
//scanf("%d",&mat[i][2]);
//f>>mat[i][1]>>mat[i][2];
f>>mat[1][i]>>mat[2][i];
/*if(mat[i][2]==1)printf("%lld\n",v[mat[i][1]]);
else cauta(v[v[mat[i][1]]],mat[i][2],2);*/
}
for(i=1;i<=m;i++)
{
//if(mat[i][2]==1)/*printf("%d\n",v[mat[i][1]]);*/g<<v[mat[i][1]]<<"\n";
if(mat[2][i]==1)/*printf("%d\n",v[mat[i][1]]);*/g<<v[mat[1][i]]<<"\n";
//else cauta(v[v[mat[i][1]]],mat[i][2],2);
else cauta(v[v[mat[1][i]]],mat[2][i],2);
}
f.close();
g.close();
return 0;
}