Cod sursa(job #1632609)
Utilizator | Data | 6 martie 2016 10:34:41 | |
---|---|---|---|
Problema | Stramosi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
int D[250005][19], N, M, Q, P;
void dinamica()
{
for(int i=1; i<=N; ++i)
for(int j=1; (1<<j)<=N; ++j)
D[i][j] = D[ D[i][j-1] ][j-1];
}
int main()
{
freopen("stramosi.in", "r", stdin);
freopen("stramosi.out", "w", stdout);
scanf("%d%d", &N, &M);
for(int i=1; i<=N; ++i)
scanf("%d", &D[i][0]);
dinamica();
for(int i=1; i<=M; ++i)
{
scanf("%d%d", &Q, &P);
for(int j=0; (1<<j)<=P; ++j)
if(P & (1<<j))
Q = D[Q][j];
cout<<Q<<'\n';
}
return 0;
}