Cod sursa(job #2626891)
| Utilizator | Data | 8 iunie 2020 21:15:25 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f ("stramosi.in");
ofstream g ("stramosi.out");
int n, q;
int tata[250005];
int Ancestor (int nod, int nr)
{
for (int i=1; i<=nr && nod; i++)
nod = tata[nod];
return nod;
}
int main()
{
f >> n >> q;
for (int i=1; i<=n; i++)
f >> tata[i];
while (q --)
{
int nod, nr;
f >> nod >> nr;
g << Ancestor(nod, nr) << "\n";
}
return 0;
}
