Pagini recente » Cod sursa (job #391530) | Rating Lord Belial (belial) | Cod sursa (job #2779304) | Cod sursa (job #1985373) | Cod sursa (job #2252939)
#include <fstream>
using namespace std;
const int NMAX = 250010;
int n, m;
int dp[19][NMAX];
int exp[NMAX];
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[0][i];
for (int i = 1;(1 << i) <= n;++i)
exp[(1 << i)] = i;
for (int p = 1;(1 << p) <= n;++p)
for (int i = 1;i <= n;++i)
dp[p][i] = dp[p - 1][dp[p - 1][i]];
int p, q, x;
for (int i = 1;i <= m;++i)
{
fin >> q >> p;
while (p > 0)
{
x = exp[lsb(p)];
q = dp[x][q];
p -= lsb(p);
}
fout << q << "\n";
}
fin.close();
fout.close();
return 0;
}