Pagini recente » Cod sursa (job #2643667) | Cod sursa (job #1482803)
#include <fstream>
#include <vector>
using namespace std;
struct comanda{
int cati, care;
comanda(const int x, const int r):
cati(x), care(r){} };
struct el{
int cur, copil;
el(const int c1, const int c2):
cur(c1), copil(c2){} };
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<el> trail = { el{0, 0} };
while(!trail.empty()){
const int cur = trail.back().cur, copil = trail.back().copil;
trail.pop_back();
if(copil == 0){
for(const auto c : comenzi[cur]){
rez[c.care] = trail[max(int(trail.size())-c.cati, 0)].cur; } }
if(copil < copii[cur].size()){
trail.emplace_back(cur, copil+1);
trail.emplace_back(copii[cur][copil], 0); } }
for(const auto x : rez){
g << x << '\n'; }
return 0; }