Pagini recente » Cod sursa (job #221203) | Cod sursa (job #3228242) | Cod sursa (job #509378) | Cod sursa (job #1094897) | Cod sursa (job #3134681)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("stramosi.in");
ofstream cout("stramosi.out");
const int NMAX = 25e4;
const int LOGMAX = 18;
int n, m;
int T[NMAX + 1];
int parent[NMAX + 1][LOGMAX + 1];
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
cin >> T[i];
for(int i = 1; i <= n; i++)
parent[i][0] = T[i];
for(int k = 1; k <= LOGMAX; k++)
for(int i = 1; i <= n; i++)
parent[i][k] = parent[parent[i][k - 1]][k - 1];
for(int i = 1; i <= m; i++)
{
int P, Q;
cin >> Q >> P;
int Node = Q;
for(int i = LOGMAX; i >= 0; i--)
if((1 << i) & P)
Node = parent[Node][i];
cout << Node << '\n';
}
return 0;
}