Cod sursa(job #2055296)
Utilizator | Data | 3 noiembrie 2017 00:21:12 | |
---|---|---|---|
Problema | Stramosi | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin ("stramosi.in");
ofstream fout ("stramosi.out");
int n,m,i,k,x,y,D[33][250001];
int main(){
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>D[0][i];
for(k=1;1<<k<=n;k++)
for(i=1;i<=n;i++)
D[k][i]=D[k-1][D[k-1][i]]; //dinamica rmq = al 2^k lea stramos al lui i
for(i=1;i<=m;i++){
fin>>x>>y;
while(y>0){ //cat timp stramosi
x=D[(int)log2(y)][x]; //mergi prin tati
y-=1<<(int)log2(y);
}
fout<<x<<"\n";
}
}