Pagini recente » Cod sursa (job #2045485) | Cod sursa (job #1454037) | Istoria paginii runda/baraj2017 | Cod sursa (job #1239466) | Cod sursa (job #1335943)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const int Nmax = 250000 + 2;
vector <int> v[Nmax];
int tata[Nmax];
int n,m,i,x,y;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
{
fin>>tata[i];
}
for(i=1;i<=m;i++)
{
fin>>x>>y;
if(tata[x]==0)
{
fout<<"0\n";
}
else{
while(y>0)
{
y--;
x=tata[x];
}
fout<<x<<"\n";
}
}
for(i=1;i<=n;i++)
{
//fout<<tata[i]<<" ";
}
}