Cod sursa(job #2231241)
Utilizator | Data | 13 august 2018 15:50:37 | |
---|---|---|---|
Problema | Stramosi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <bits/stdc++.h>
#define nmax 250005
using namespace std;
int d[20][nmax];
int main()
{
int n,m,nod,p,poz;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
fin>>n>>m;
for(int i=1;i<=n;i++){
fin>>d[0][i];
}
for(int i=1;i<20;i++)
for(int j=1;j<=n;j++)
{
d[i][j]=d[i-1][ d[i-1][j] ];
}
for(int q=1;q<=m;q++){
fin>>nod>>p;
for(int e=0;e<20;e++){
if(p&(1<<e)){
nod=d[e][nod];
}
}
fout<<nod<<'\n';
}
return 0;
}