Pagini recente » Cod sursa (job #1834148) | Monitorul de evaluare | Cod sursa (job #1777506) | Cod sursa (job #1510281) | Cod sursa (job #2214431)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n, m;
int dp[250010][30], tati[250010];
int creez_dinamica()
{
for(int j = 1; j < 22; j++)
for(int i = 0; i <= n; i++)
dp[i][j] = dp[dp[i][j-1]][j-1];
}
int query(int x, int p)
{
int putere = 1, contor = 0;
while(putere <= p)
{
putere *= 2;
contor++;
}
putere /= 2;
contor--;
if(putere == p)
return dp[x][contor];
else
query(dp[x][contor], p - putere);
}
int main()
{
int x, p;
f >> n >> m;
for(int i = 1; i <= n; i++)
{
f >> tati[i];
dp[i][0] = tati[i];
}
creez_dinamica();
/* for(int i = 1; i <= n; i++)
{
g << "Nodul: " << i << '\n';
for(int j = 0; j < 6; j++)
g << dp[i][j] << " ";
g << '\n';
} */
for(int i = 0; i < m; i++)
{
f >> x >> p;
g << query(x, p);
g << '\n';
}
}