Pagini recente » Cod sursa (job #2158559) | Cod sursa (job #2873999) | Cod sursa (job #2204959) | Cod sursa (job #808406) | Cod sursa (job #3238270)
#include <fstream>
#define int long long
#define pii pair<int, int>
#define fs first
#define sd second
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int str[250004][30];
void solve() {
}
signed main() {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
int n, m; fin >> n >> m;
int i, j, k, q, nr;
for(i = 1; i <= n; i++) {
fin >> j;
str[i][0] = j;
for(j = 1, k = 1; i > j; j = j << 1, k++)
str[i][k] = str[str[i][k - 1]][k - 1];
}
while(m--) {
cin >> q >> nr;
k = j = 0;
for(i = 20; i >= 0; i--) {
if(nr >= 1 << i) {
q = str[q][i];
nr -= 1 << i;
}
if(nr == 0)
break;
}
fout << q << '\n';
}
return 0;
}