Pagini recente » Cod sursa (job #1558287) | Cod sursa (job #2198773) | Cod sursa (job #1124644) | Cod sursa (job #3279784) | Cod sursa (job #1976328)
#include <cstdio>
using namespace std;
const int NMAX = 250000;
int d[NMAX + 5][20];
int main()
{
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
int n, m, p, q;
scanf("%d %d", &n, &m);
for(int i = 1;i <= n;++i)
scanf("%d", &d[i][0]);
for(int j = 1;j <= 17;++j)
for(int i = 1; i <= n;++i)
d[i][j] = d[d[i][j - 1]][j - 1];
for(int i = 1;i <= m;++i)
{
scanf("%d %d", &q, &p);
for(int j = 17;j >= 0;--j)
if(((1 << j) & p) != 0)
q = d[q][j];
printf("%d\n", q);
}
return 0;
}