Pagini recente » Cod sursa (job #342152) | Cod sursa (job #2821629) | Cod sursa (job #829293) | Cod sursa (job #709752) | Cod sursa (job #2503218)
#include <fstream>
#include <iostream>
#define NMAX 250000
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n, q, dp[NMAX+10][20];
int main()
{
f >> n >> q;
for(int i=1; i<=n; i++) f >> dp[i][0];
for(int i=1; i<=18; i++)
for(int j=1; j<=n; j++) dp[j][i] = dp[dp[j][i-1]][i-1];
while(q--)
{ int nod, dist, sol;
f >> nod >> dist;
sol = nod;
for(int i=0; i<=18; i++) if((dist & (1 << i))) sol = dp[sol][i], dist = dist ^ (1 << i);
g << sol << '\n';
}
return 0;
}