Pagini recente » Diferente pentru info-oltenia-2018/individual/clasament/5-6 intre reviziile 2 si 1 | Cod sursa (job #650046) | Monitorul de evaluare | Cod sursa (job #1567189) | Cod sursa (job #365250)
Cod sursa(job #365250)
//#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];
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 {/*printf("0\n");*/g<<"0\n";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;
}