Pagini recente » Cod sursa (job #2789203) | Cod sursa (job #400453) | Cod sursa (job #1309799) | Cod sursa (job #2660237) | Cod sursa (job #2503242)
#include <fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n, q, dp[250010][20], nod, dist;
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];
for(int j=1; j<=q; j++)
{ f >> nod >> dist;
for(int i=0; (1<<i)<=dist; i++) if((dist & (1 << i))) nod = dp[nod][i];
g << nod << '\n';
}
return 0;
}