Pagini recente » Cod sursa (job #2084189) | Cod sursa (job #1650700) | Cod sursa (job #2641591) | Cod sursa (job #2084049) | Cod sursa (job #1689739)
#include <bits/stdc++.h>
#define NMax 250005
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n,m,p,q,ANS;
int tata[NMax];
int a[30][NMax];
int main()
{
f >> n >> m;
for(int i = 1; i <= n; ++i){
f >> a[0][i];
}
for(int i = 1; (1<<i) <= n; ++i){
for(int j = 1; j <= n; ++j){
a[i][j] = a[i - 1][a[i - 1][j]];
}
}
for(int i = 1; i <= m; ++i){
f >> p >> q;
for(int j = 0; (1<<j) <= n; ++j){
if((1<<j) & q){
p = a[j][p];
}
}
g << p << '\n';
}
return 0;
}