Cod sursa(job #3286807)
| Utilizator | Data | 14 martie 2025 18:05:58 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int main() {
int n, m;
fin >> n >> m;
vector<int> parent(n + 1, 0);
for (int i = 1; i <= n; i++) {
fin >> parent[i];
}
for (int i = 0; i < m; i++) {
int node, k;
fin >> node >> k;
while (k > 0 && node != 0) {
node = parent[node];
k--;
}
fout << node << endl;
}
return 0;
}
