Cod sursa(job #1813019)
Utilizator | Stepanov Paul paulstepanov | Data | 22 noiembrie 2016 17:20:48 |
---|---|---|---|
Problema | Stramosi | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
const int NMax = 250005;
int N,M;
int TT[NMax];
void Read()
{
fin >> N >> M;
for(int i = 1; i <= N; ++i)
fin >> TT[i];
}
int Ancestor(int Q, int P)
{
while(P)
{
Q = TT[Q];
P--;
}
return Q;
}
void SolveandPrint()
{
while(M--)
{
int Q,P;
fin >> Q >> P;
fout << Ancestor(Q,P)<<"\n";
}
}
int main()
{
Read();
SolveandPrint();
return 0;
}