Cod sursa(job #1365388)
| Utilizator | Data | 28 februarie 2015 11:45:40 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int N,M,q,p,i,j,DP[250100][22];
int main()
{
freopen("stramosi.in","r",stdin);
freopen("stramosi.out","w",stdout);
scanf("%d%d",&N,&M);
for(i=1;i<=N;i++)
scanf("%d",&DP[i][0]);
for(j=1;j<=20;j++)
for(i=1;i<=N;i++)
{
DP[i][j] = DP[DP[i][j-1]][j-1];
}
while(M--)
{
scanf("%d%d",&q,&p);
for(j=20;j>=0;j--)
{
if(p >= (1<<j))
{
q = DP[q][j];
p = p - (1<<j);
}
}
printf("%d\n",q);
}
}
