Pagini recente » Cod sursa (job #2796379) | Cod sursa (job #2666872) | Cod sursa (job #2852894) | Cod sursa (job #687825) | Cod sursa (job #2491477)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n, m, x, y, dp[250005][20], logg[250005], poww[20];
int main()
{
fin >> n >> m;
for (int i = 1; i <= n; ++i)
{
int nod;
fin >> nod;
dp[i][0] = nod;
}
for (int i = 0; i <= 18; ++i)
{
poww[i] = (1 << i);
}
for (int i = 2; i <= n; ++i)
{
logg[i] = 1 + logg[i / 2];
}
for (int j = 1; poww[j] <= n; ++j)
{
for (int i = 1; i <= n; ++i)
{
dp[i][j] = dp[dp[i][j - 1]][j - 1];
}
}
while (m--)
{
fin >> x >> y;
int putere = poww[logg[y]];
while (putere != y)
{
x = dp[x][logg[y]];
y = y - putere;
putere = poww[logg[y]];
}
fout << dp[x][logg[y]] << "\n";
}
fin.close();
fout.close();
return 0;
}