Cod sursa(job #2286524)
Utilizator | Data | 20 noiembrie 2018 14:06:49 | |
---|---|---|---|
Problema | Stramosi | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
#include <cstring>
#include <algorithm>
# define mod 1000000
using namespace std;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
int i,n,m,nod,poz,j,p[250001],t[250001][20];
int main(){
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>t[i][0];
for(i=2;i<=n;i++)p[i]=p[i/2]+1;
for(j=1;j<=p[n];j++)
for(i=1;i<=n;i++)
t[i][j]=t[t[i][j-1]][j-1];
for(i=1;i<=m;i++)
{
fin>>nod>>poz;
for(j=0;(1<<j)<=poz;j++)if(poz&(1<<j)) nod=t[nod][j];
fout<<nod<<"\n";
}
return 0;
}