Cod sursa(job #2154846)
| Utilizator | Data | 7 martie 2018 12:49:09 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
int N,M;
int DP[19][2500001];
ifstream f("stramosi.in");
ofstream g("stramosi.out");
int main()
{
f>>N>>M;
for(int i=1; i<=N; i++)
f>>DP[0][i];
for(int i=1; (1<<i)<=N; i++)
for(int j=1; j<=N; j++)
DP[i][j]=DP[i-1][DP[i-1][j]];
for(int i=1; i<=M; i++)
{
int Q,P,power=0;
f>>Q>>P;
while(P)
{
if(P&2) Q=DP[power++][Q];
P>>=1;
}
g<<Q<<'\n';
}
}
