Pagini recente » Statisticile problemei Pesti | Cod sursa (job #540569) | Cod sursa (job #2414947) | Cod sursa (job #3042078) | Cod sursa (job #1979110)
#include <fstream>
#include <vector>
#define MAXN 250001
using namespace std;
ifstream f ("stramosi.in");
ofstream g ("stramosi.out");
vector < int > v[MAXN];
vector < int > sol[MAXN];
vector < int > stiva;
int n, m;
bool used[MAXN];
int DFS(int u){
used[u] = 1;
stiva.push_back(u);
for(int i = 0; i < v[u].size(); ++i){
for(int j = stiva.size() - 1; j >= 0; --j)
sol[v[u][i]].push_back(stiva[j]);
DFS(v[u][i]);
}
stiva.erase(stiva.begin() + stiva.size() - 1);
}
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){
if(!used[i])
DFS(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';
}
}