Pagini recente » Cod sursa (job #1391788) | Cod sursa (job #2145623) | Cod sursa (job #700639) | Cod sursa (job #1392697) | Cod sursa (job #1478905)
#include <fstream>
#include <vector>
#include <functional>
#include <iostream>
using namespace std;
struct comanda{
int cati, care;
comanda(const int x, const int r):
cati(x), care(r){} };
void dfs(const vector<vector<int> >& copii,
vector<vector<comanda> >& comenzi,
vector<int>& parinti,
vector<int>& rez){
const int cur = parinti.back();
for(auto c : comenzi[cur]){
rez[c.care] = parinti[max(int(parinti.size())-1-c.cati, 0)]; }
for(const auto next : copii[cur]){
parinti.push_back(next);
dfs(copii, comenzi, parinti, rez);
parinti.pop_back(); } }
int main(){
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int n, m;
f >> n >> m;
vector<vector<int> > copii(n+1);
for(int i = 1, x; i <= n; ++i){
f >> x;
copii[x].push_back(i); }
vector<int> rez(m);
vector<vector<comanda> > comenzi(n+1);
for(int i = 0, q, p; i < m; ++i){
f >> q >> p;
comenzi[q].emplace_back(p, i); }
vector<int> parinti = {0};
dfs(copii, comenzi, parinti, rez);
for(const auto x : rez){
g << x << '\n'; }
return 0; }