Pagini recente » Cod sursa (job #419847) | Cod sursa (job #1416025) | Cod sursa (job #1342095) | Cod sursa (job #1132950) | Cod sursa (job #3261498)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("stramosi.in");
ofstream cout("stramosi.out");
const int Nmax = 250001;
int n, m, x, y;
int anc[20][Nmax];
void binarylifting()
{
for(int l=1; l<20; l++)
for(int i=1; i<=n; i++)
anc[l][i] = anc[l-1][anc[l-1][i]];
}
int ans(int node, int nanc)
{
if(nanc >= (1<<20))
return 0;
for(int l=0; l<20; l++)
if(nanc & (1<<l))
node = anc[l][node];
return node;
}
int main()
{
cin >> n >> m;
// anc.assign(n+1, vector<int>(20, 0));
for(int i=1; i<=n; i++)
cin >> anc[0][i];
binarylifting();
while(m--)
{
cin >> x >> y;
cout << ans(x, y) << '\n';
}
return 0;
}