Pagini recente » Cod sursa (job #75478) | Cod sursa (job #120208) | Cod sursa (job #2217409) | Cod sursa (job #1935014) | Cod sursa (job #3297387)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int ancestors[250001][20];
int main()
{
int n, m;
fin >> n >> m;
// citim parintii
for (int i = 1; i <= n; i++)
fin >> ancestors[i][0];
// construim matricea stramosi
for (int i = 1; i <= n; i++)
for (int j = 1; j < 19; j++)
ancestors[i][j] = ancestors[ancestors[i][j - 1]][j - 1];
// citim interogari si afisam rezultatele
for (int i = 0; i < m; i++)
{
int person, k;
fin >> person >> k;
int depth = 0;
while (k)
{
if (k & 1)
person = ancestors[person][depth];
k >>= 1;
depth++;
}
fout << person << '\n';
}
fin.close();
fout.close();
return 0;
}