#include "dungeons.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "Ofast")
#define ll long long
#define se second
#define fi first
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
typedef pair<ll,ll> pii;
typedef pair<pii,pii> ipii;
const int MAXN = 1e6+10;
const int MAXA = 5e4+10;
const int SQRT = 300;
const ll INF = 1e9;
const int MOD = 998244353;
const int LOG = 20;
ll n, s[MAXN], p[MAXN], w[MAXN], l[MAXN];
pii bin[MAXN][LOG+5];
ll up[MAXN];
void init(int N, std::vector<int> S, std::vector<int> P, std::vector<int> W, std::vector<int> L) {
n = N;
for(int i=1; i<=n; i++){
s[i] = S[i-1], p[i] = P[i-1], w[i] = W[i-1]+1, l[i] = L[i-1]+1;
}
for(int i=n; i>=1; i--){
up[i] = up[w[i]]+s[i];
bin[i][0] = {l[i], p[i]};
}
for(int j=1; j<LOG; j++){
for(int i=1; i<=n; i++){
ll nx = bin[i][j-1].fi, wei = bin[i][j-1].se;
bin[i][j] = {bin[nx][j-1].fi, wei + bin[nx][j-1].se};
}
}
return;
}
long long simulate(int x, int z) {
ll idx = x+1, pow = z;
if(pow >= s[1]){
return pow + up[idx];
}
ll tot = 0;
for(int i=LOG-1; i>=0; i--){
if(bin[idx][i].fi == n+1 || tot+pow+bin[idx][i].se >= s[1]) ;
else {
tot += bin[idx][i].se;
idx = bin[idx][i].fi;
}
}
pow += tot + bin[idx][0].se;
pow += up[ bin[idx][0].fi ];
return pow;
}
