Pagini recente » Cod sursa (job #261402) | Cod sursa (job #1865762) | Cod sursa (job #2781670) | Cod sursa (job #469480) | Cod sursa (job #2252930)
#include <fstream>
#include <iostream>
using namespace std;
const int NMAX = 250010;
int n, m;
int dp[NMAX][19];
inline int lsb(const int &x)
{
return (x & (-x));
}
int main()
{
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
fin >> n >> m;
for (int i = 1;i <= n;++i)
fin >> dp[i][0];
for (int p = 1;(1 << p) <= n;++p)
for (int i = 1;i <= n;++i)
dp[i][p] = dp[dp[i][p - 1]][p - 1];
int p, q;
for (int i = 1;i <= m;++i)
{
fin >> q >> p;
for (int x = 0;(1 << x) <= p;++x)
{
if (((1 << x) & p) != 0)
q = dp[q][x];
}
fout << q << "\n";
}
fin.close();
fout.close();
return 0;
}