Pagini recente » Cod sursa (job #2715898) | Cod sursa (job #203507) | Cod sursa (job #990558) | Cod sursa (job #1303263) | Cod sursa (job #577595)
Cod sursa(job #577595)
#include <fstream>
using namespace std;
#define DN 250005
#define DLGN 19
ifstream fi("stramosi.in");
ofstream fo("stramosi.out");
int N, logN, M, P, Q, T[DLGN][DN], D1[DN], D2[DN], R[DN];
void prep1()
{
for (int i = 2; i <= N; i++)
{
D1[i] = D1[i>>1] + 1;
D2[i] = D2[(i+1)>>1] + 1;
}
}
void prep2()
{
int i, k;
for (k = 2; k <= logN; k++)
for (i = 1; i <= N; i++)
if (T[0][i] >= k)
T[k][i] = T[k-1][T[k-1][i]];
}
int main()
{
fi >> N >> M;
prep1();
for (int i = 1; i <= N; i++)
{
fi >> T[1][i];
R[i] = R[T[1][i]] + 1;
T[0][i] = D2[R[i]];
if (T[0][i] > logN)
logN = T[0][i];
}
prep2();
for (int i = 0; i < M; i++)
{
fi >> Q >> P;
while (P != 0)
{
Q = T[D1[P]+1][Q];
P -= 1 << D1[P];
}
fo << Q << '\n';
}
}