Cod sursa(job #1897174)
| Utilizator | Data | 1 martie 2017 11:02:30 | |
|---|---|---|---|
| Problema | Stramosi | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int n,m,nod,lev;
const int LOGMAX = 20;
const int NMAX = 250020;
int dp[LOGMAX][NMAX];
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++) {
fin>>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++) {
fin>>nod>>lev;
for(int j=0;j<=lev;j++)
if((1<<j)&lev)
nod=dp[j][nod];
fout<<nod<<'\n';
}
fin.close();
fout.close();
return 0;
}
