Pagini recente » Cod sursa (job #2725714) | Cod sursa (job #1055895) | Cod sursa (job #120818) | Cod sursa (job #540138) | Cod sursa (job #1979066)
#include <fstream>
#include <vector>
#define MAXN 250005
using namespace std;
ifstream f ("stramosi.in");
ofstream g ("stramosi.out");
vector < int > v[MAXN];
vector < int > sol[MAXN];
int n, m;
int l, stiva[MAXN], used[MAXN];
int DFS(int l, int u){
used[u] = 1;
stiva[++l] = u;
int k = v[u].size();
for(int i = 0; i < k; ++i){
int nod = v[u][i];
for(int j = l; j >= 1; --j){
int m = stiva[j];
sol[nod].push_back(m);
}
if(!used[nod]){
DFS(l, nod);
}
}
--l;
}
int main(){
f >> n >> m;
for(int i = 1; i <= n; ++i){
int x;
f >> x;
if(x) v[x].push_back(i);
}
for(int i = 1; i <= n; ++i){
l = 0;
if(!used[i]){
DFS(0, i);
}
}
for(int i = 1; i <= m; ++i){
int x, y;
f >> x >> y;
if(y < sol[x].size() + 1 && !sol[x].empty()) g << sol[x][y-1] << '\n';
else g << 0 << '\n';
}
}