Pagini recente » Cod sursa (job #2459416) | Cod sursa (job #803002) | Cod sursa (job #1751405) | Cod sursa (job #3142173) | Cod sursa (job #2506715)
#include <fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
int main() {
ios::sync_with_stdio(0);
in.tie(0);
out.tie(0);
int N, M, anc[250001][18], lg[250001], lvl[250001];
in>>N>>M;
lg[2] = 1;
for(register int i = 3; i <= N; ++i) {
lg[i] = 1 + lg[i / 2];
}
for(register int i = 1; i <= N; ++i) {
in>>anc[i][0];
lvl[i] = lvl[i - 1] + 1;
for(register int j = 1; j <= lg[lvl[i]]; ++j) {
anc[i][j] = anc[anc[i][j - 1]][j - 1];
}
}
while(M--) {
int P, Q;
in>>P>>Q;
while(1) {
if(anc[P][0] == 0 || Q > lvl[P] - 1) {
out<<0<<"\n";
break;
}
if(anc[P][lg[Q]] != 0 && (1 << lg[Q]) == Q) {
out<<anc[P][lg[Q]]<<"\n";
break;
}
P = anc[P][lg[Q]];
Q -= (1<<lg[Q]);
}
}
return 0;
}