Pagini recente » Cod sursa (job #890556) | Cod sursa (job #1087454) | Cod sursa (job #1843546) | Cod sursa (job #5032) | Cod sursa (job #3282303)
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream fin ("stramosi.in");
ofstream fout ("stramosi.out");
const int nmax=1e5+5;
int n, m, dp[25][nmax];
signed main()
{
fin >> n >> m;
for (int i=1; i<=n; i++)
fin >> dp[0][i];
for (int i=1; (1<<i)<=n; i++)
{
for (int j=1; j<=n; j++)
dp[i][j]=dp[i-1][dp[i-1][j]];
}
for (int i=1; i<=m; i++)
{
int x, k;
fin >> x >> k;
for (int j=20; j>=0; j--)
{
if ((1<<j)<=k)
{
k-=(1<<j);
x=dp[j][x];
}
}
fout << x << '\n';
}
return 0;
}