Pagini recente » Cod sursa (job #2034375) | Cod sursa (job #1297964) | Cod sursa (job #639056) | Statistici Lazarescu Antonio-Georgian (lazarescuant) | Cod sursa (job #1997440)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("stramosi.in");
ofstream g("stramosi.out");
const int nmax = 300005, mmax = 300005;
int n, m, i, j, x, y, stv[nmax], sol[mmax], niv[nmax];
bool viz[nmax];
vector <int> ls[nmax], qr[mmax], lv[mmax];
inline void dfs(int x) {
int i;
viz[x] = 1;
for (i = 0; i < ls[x].size(); i++) {
niv[ls[x][i]] = niv[x]+1;
stv[niv[x]] = x;
dfs(ls[x][i]);
}
for (i = 0; i < qr[x].size(); i++)
if (niv[x]>=lv[x][i]) sol[qr[x][i]] = stv[niv[x]-lv[x][i]];
}
int main() {
f >> n >> m;
for (i = 1; i <= n; i++) {
f >> x;
if (x) ls[x].push_back(i);
}
for (i = 1; i <= m; i++) {
f >> x >> y;
qr[x].push_back(i);
lv[x].push_back(y);
}
for (i = 1; i <= n; i++)
if (viz[i] == 0)
dfs(i);
for (i = 1; i <= m; i++)
g << sol[i] << '\n';
}