Pagini recente » Diferente pentru problema/easyvect intre reviziile 17 si 1 | Monitorul de evaluare | Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #3331921)
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define setinf(x) memset(x,0x3f3f3f3f,sizeof(x));
#define set0(x) memset(x,0,sizeof(x));
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define vi vector<int>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define fi first
#define se second
#define DD 250001
#define nl '\n'
using namespace std;
const string file="stramosi";
ifstream f(file+".in");
ofstream g(file+".out");
//#define f cin
//#define g cout
int n,q;
vi v[DD];
int up[19][DD],fr[DD];
void dfs(int x, int p) {
fr[x]=1;
up[0][x]=p;
for (int i=1; i<19; ++i)
up[i][x]=up[i-1][up[i-1][x]];
for (auto e:v[x]) {
if (e==p) continue;
dfs(e,x);
}
}
int kth(int x, int k) {
for (int i=0; i<19; ++i)
if (k&(1<<i)) x=up[i][x];
return x;
}
int main(){
f>>n>>q;
for (int i=1; i<=n; ++i) {
int dad;
f>>dad;
if (dad!=0) v[i].pb(dad),v[dad].pb(i);
}
for (int i=1; i<=n; ++i) {
if (!fr[i]) dfs(i,0);
}
while (q--) {
int x,k;
f>>x>>k;
g<<kth(x,k)<<nl;
}
system("pause");
return 0;
}