#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
int X,Y,n;
vector<vii> ps,sm,th;
vi pw,arr,P,W,L;
void init(int N, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
X=9;n=N;
arr=s;P=p;W=w;L=l;
Y=log2(n)+2;
pw.resize(X+1,1);
REP(i,1,X+1)pw[i]=pw[i-1]*8;
ps.resize(X,vii(n,vi(Y)));
sm.resize(X,vii(n,vi(Y)));
th.resize(X,vii(n,vi(Y)));
REP(i,0,X){
REP(j,0,n){
if(s[j]<pw[i]){
ps[i][j][0]=w[j];
sm[i][j][0]=s[j];
}
else{
ps[i][j][0]=l[j];
sm[i][j][0]=p[j];
}
th[i][j][0]=s[j];
}
REP(k,1,Y)REP(j,0,n){
if(ps[i][j][k-1]==n){
ps[i][j][k]=n;
continue;
}
ps[i][j][k]=ps[i][ps[i][j][k-1]][k-1];
sm[i][j][k]=sm[i][j][k-1]+sm[i][ps[i][j][k-1]][k-1];
th[i][j][k]=min(th[i][j][k-1],th[i][ps[i][j][k-1]][k-1]-sm[i][j][k-1]);
}
}
return;
}
long long simulate(int x, int y) {
while(x!=n){
int t=upper_bound(all(pw),y)-pw.begin();
t--;
for(int k=Y-1;k>=0;k--)if(ps[t][x][k]!=n&&y<th[t][x][k]){
y+=sm[t][x][k];
x=ps[t][x][k];
}
if(arr[x]<=y){
y+=arr[x];
x=W[x];
}
else{
y+=P[x];
x=L[x];
}
}
return y;
}
