Pagini recente » Cod sursa (job #358061) | Cod sursa (job #680551) | Cod sursa (job #2633111) | Cod sursa (job #641488) | Cod sursa (job #1537991)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
#define nmax 250005
ifstream s("stramosi.in");
ofstream g("stramosi.out");
int f[19][nmax];
int query(int p, int q)
{
for (int i = 0; (1<<i) <= p ; i++)
if ((1<<i)&p)
q = f[i][q];
return q;
}
int main()
{
int n,m;
s >> n >> m;
for(int i = 1; i<=n; i++)
s >> f[0][i];
for(int i = 1; (1<<i) <= n; i++)
for(int j = 1; j <= n; j++)
f[i][j] = f[i-1][f[i-1][j]];
for(int i = 1; i<=m; i++)
{
int x,y;
s >>x >>y;
g<<query(y, x)<<'\n';
}
return 0;
}