Pagini recente » Cod sursa (job #2762084) | Cod sursa (job #148116) | Cod sursa (job #1105773) | Cod sursa (job #928810) | Cod sursa (job #2977220)
#include <fstream>
using namespace std;
ifstream fin ("stramosi.in");
ofstream fout("stramosi.out");
#define NMAX 250001
#define LMAX 20
int T[NMAX][LMAX];
int n,m;
int query(int nod, int nivel)
{
for (int j = LMAX - 1; j >= 0; j--)
{
if (nivel & (1 << j))
{
nod = T[nod][j];
}
}
return nod;
}
int main()
{
fin >> n >> m;
for (int i=1; i<=n; i++)
{
fin >> T[i][0];
}
for (int j=1; j<LMAX; j++)
{
for (int i=1; i<=n; i++)
T[i][j] = T[T[i][j-1]][j-1];
}
for (int i=0; i<m; i++)
{
int a,b;
fin >> a >> b;
fout << query(a,b) << '\n';
}
return 0;
}