Pagini recente » Cod sursa (job #835077) | Borderou de evaluare (job #1008047) | Cod sursa (job #1141610) | Cod sursa (job #1904186) | Cod sursa (job #3214885)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
const int Nmax = 250001;
const int Mmax = 300001;
vector<int> L[Nmax];
int stramos[Nmax][21];
int tata[Nmax];
int main(){
int n, m;
ifstream fin("stramosi.in");
ofstream fout("stramosi.out");
fin>>n>>m;
for(int i=1;i<=n;i++){
int x;
fin>>x;
tata[i]=x;
}
for(int i=1;i<=n;i++){
stramos[i][0] = tata[i];
}
for(int j=1;j<=20;j++){
for(int i=1;i<=n;i++){
stramos[i][j] = stramos[stramos[i][j-1]][j-1];
}
}
for(int i=1;i<=m;i++){
int p, q;
fin>>p>>q;
for(int j=20;j>=0;j--){
if((1<<j) <= q){
p = stramos[p][j];
q-=(1<<j);
}
}
fout<<p<<'\n';
}
}