// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 4e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
const int LOG = 19;
#include "dungeons.h"
#define data DATA
struct data{
ll sum,mn;
data(){
sum = 0;
mn = inf2;
}
data(ll x){
sum = x;
mn = -x;
}
};
data merge(data &left, data &right){
data curr;
curr.sum = left.sum + right.sum;
curr.mn = min(left.mn,left.sum+right.mn);
return curr;
}
int lose[N][LOG];
int win[N][LOG];
data dat[N][LOG];
int n;
vector<int> s,p,w,l;
void init(int n_, std::vector<int> s_, std::vector<int> p_, std::vector<int> w_, std::vector<int> l_) {
n = n_;
s = s_;
p = p_;
w = w_;
l = l_;
rep(j,LOG){
win[n][j] = lose[n][j] = n;
dat[n][j] = data();
}
rep(i,n){
win[i][0] = w[i];
lose[i][0] = l[i];
dat[i][0] = data(p[i]);
}
rep1(j,LOG-1){
rep(i,n){
win[i][j] = win[win[i][j-1]][j-1];
lose[i][j] = lose[lose[i][j-1]][j-1];
dat[i][j] = merge(dat[i][j-1],dat[lose[i][j-1]][j-1]);
}
}
}
long long simulate(int x, int z_) {
ll z = z_;
// lose on some pref, then win on some suff
if(z < s[0]){
ll l = 0, r = 1e7+5;
ll first = -1;
while(l <= r){
ll mid = (l+r) >> 1;
ll sum = 0;
ll u = x;
rep(j,LOG){
if(mid & (1<<j)){
sum += dat[u][j].sum;
u = lose[u][j];
}
}
if(z+sum >= s[0] or u == n){
first = mid;
r = mid-1;
}
else{
l = mid+1;
}
}
assert(first != -1);
rep(j,LOG){
if(first & (1<<j)){
z += dat[x][j].sum;
x = lose[x][j];
}
}
// rev(j,LOG-1,0){
// if(z+dat[x][j].sum < s[0]){
// z += dat[x][j].sum;
// x = lose[x][j];
// }
// }
// z += dat[x][0].sum;
// x = lose[x][0];
}
if(x < n){
ll win_cnt = 0;
rev(j,LOG-1,0){
if(win[x][j] < n){
x = win[x][j];
win_cnt += 1<<j;
}
}
win_cnt++;
z += win_cnt*s[0];
}
return z;
}
