Pagini recente » Cod sursa (job #686864) | Cod sursa (job #1403587) | Cod sursa (job #553257) | Cod sursa (job #1811165) | Cod sursa (job #2714628)
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n, m, tata[250005];
int D[20][250005];
void stramosi()
{
for (int i = 1; (1 << i) < n; i++)
for (int j = 1; j <= n; j++)
D[i][j] = D[i - 1][D[i - 1][j]];
}
int stramosi2(int Q, int P)
{
int x = 0;
for (x = 0; (1 << x) <= P; x++);
if (x == 0)
return Q;
else
{
x--;
return stramosi2(D[x][Q], P - (1 << x));
}
}
int main()
{
fin >> n >> m;
for (int i = 1; i <= n; i++)
{
fin >> tata[i];
D[0][i] = tata[i];
}
stramosi();
for (int i = 1; i <= m; i++)
{
int Q, P;
fin >> Q >> P;
fout << stramosi2(Q, P) << "\n";
}
return 0;
}