Pagini recente » Cod sursa (job #3213223) | Cod sursa (job #3211924) | Cod sursa (job #1953887) | Cod sursa (job #1566561) | Cod sursa (job #2816703)
#include <fstream>
#include <vector>
const int MAX_N = 25 * 1e4;
const int MAX_LOG = 18;
std::vector<int> g[1 + MAX_N];
int up[1 + MAX_N][1 + MAX_LOG];
int par[1 + MAX_N];
void dfs(int v, int p = 0) {
up[v][0] = p;
for (int i = 1; i <= MAX_LOG; i++) {
up[v][i] = up[up[v][i - 1]][i - 1];
}
for (int u : g[v]) {
if (u != p) {
dfs(u, v);
}
}
}
class InParser {
private:
FILE *fin;
char *buff;
int sp;
char read_ch() {
++sp;
if (sp == 4096) {
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume) {
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n) {
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n) {
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-') {
n = 0;
sgn = -1;
} else {
n = c - '0';
}
while (isdigit(c = read_ch())) {
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
int main() {
InParser fin("stramosi.in");
OutParser fout("stramosi.out");
int n, k;
fin >> n >> k;
for (int i = 1; i <= n; i++) {
fin >> par[i];
if (par[i] > 0) {
g[par[i]].push_back(i);
g[i].push_back(par[i]);
}
}
for (int i = 1; i <= n; i++) {
if (par[i] == 0) {
dfs(i);
}
}
while (k--) {
int v, q;
fin >> v >> q;
int answer = v;
for (int i = 0; i <= MAX_LOG; i++) {
if ((q >> i) & 1) {
answer = up[answer][i];
}
}
fout << answer << "\n";
}
return 0;
}