Cod sursa(job #657664)
| Utilizator | Data | 6 ianuarie 2012 23:56:10 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream in("stramosi.in");
ofstream out("stramosi.out");
int A[250001],Q, P, N, M;
int DFS(int p, int nr)
{
if(P == nr) return p;
if(A[p] == 0) return 0;
return DFS(A[p], ++nr);
}
int main()
{
in >> N >> M;
for(int i = 1; i <= N; i++)
in >> A[i];
for( ; M >0; --M)
{
in >> Q >> P;
out << DFS(Q, 0) << '\n';
}
return 0;
}
