Pagini recente » Cod sursa (job #3353970) | Cod sursa (job #3348975) | Monitorul de evaluare | Cod sursa (job #403104) | Cod sursa (job #3310330)
#include <bits/stdc++.h>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n, m, dp[20][250005], p, q, t;
int pwr[250005];
int main()
{
f >> n >> m;
for (int i=1; i<=n; ++i) {
f >> dp[0][i];
}
for (int p=1; p<=18; ++p)
for (int i=1; i<=n; ++i)
dp[p][i] = dp[p-1][ dp[p-1][i] ];
pwr[1] = 0;
for (int i=2; i<=n; ++i)
pwr[i] = pwr[i/2] + 1;
for (int i=1; i<=m; ++i) {
f >> q >> p;
while (p){
t = p & (-p);
q = dp[ pwr[t] ][q];
p -= t;
}
g << q << '\n';
}
return 0;
}