Pagini recente » Cod sursa (job #3203828) | Cod sursa (job #1956692) | Cod sursa (job #2864528) | Cod sursa (job #2601873) | Cod sursa (job #2570101)
#include <fstream>
using namespace std;
const int N = 250005;
int dp[20][N], n, exp[N];
void Read ()
{
ifstream fin ("stramosi.in");
int q;
fin >> n >> q;
for (int i = 1; i <= n; i++)
fin >> dp[0][i];
for (int i = 2; i <= n; i++)
exp[i] = exp[i >> 2] + 1;
for (int i = 1; i <= exp[n]; i++)
for (int j = 1; j <= n; j++)
dp[i][j] = dp[i - 1][dp[i - 1][j]];
ofstream fout ("stramosi.out");
while (q--)
{
int q, p, x;
fin >> q >> p;
while (p > 0)
{
x = exp[p & -p];
q = dp[x][q];
p -= (p & - p);
}
fout << q << "\n";
}
fout.close();
}
int main()
{
Read();
return 0;
}