#include "dungeons.h"
#include <vector>
#include <iostream>
using namespace std;
const int maxN = 50'000;
const int lgN = 20;
const int lgS = 50;
void tle_assert(bool x)
{
if(!x)
{
while(1);
}
}
long long pow2[lgS + 1];
//
int N;
vector<int> S;
vector<int> P;
vector<int> W;
vector<int> L;
//
int nxt[maxN + 1][lgS][lgN]; //dungeon
long long gain[maxN + 1][lgS][lgN];
long long min_change[maxN + 1][lgS][lgN]; //minimum start to end up in different magnitude.
void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l)
{
pow2[0] = 1;
for(int e = 1; e <= lgS; e++)
pow2[e] = 2 * pow2[e-1];
s.push_back(0);
p.push_back(0);
w.push_back(n);
l.push_back(n);
N = n;
S = s;
P = p;
W = w;
L = l;
for(int i = 0; i <= N; i++)
{
for(int k = 0; k < lgS; k++)
{
if(s[i] < pow2[k])
{
nxt[i][k][0] = w[i];
gain[i][k][0] = s[i];
min_change[i][k][0] = pow2[k+1] - gain[i][k][0];
}
else if(pow2[k] <= s[i] && s[i] < pow2[k+1])
{
nxt[i][k][0] = l[i];
gain[i][k][0] = p[i];
min_change[i][k][0] = min(pow2[k+1] - p[i], (long long)s[i]);
}
else
{
nxt[i][k][0] = l[i];
gain[i][k][0] = p[i];
min_change[i][k][0] = pow2[k+1] - gain[i][k][0];
}
}
}
for(int e = 1; e < lgN; e++)
{
for(int i = 0; i <= N; i++)
{
for(int k = 0; k < lgS; k++)
{
nxt[i][k][e] = nxt[ nxt[i][k][e-1] ][k][e-1];
gain[i][k][e] = gain[i][k][e-1] + gain[ nxt[i][k][e-1] ][k][e-1];
min_change[i][k][e] = min(min_change[i][k][e-1], min_change[ nxt[i][k][e-1] ][k][e-1] - gain[i][k][e-1]);
}
}
}
}
long long simulate(int x, int z)
{
int X = x;
long long Z = z;
for(int k = 0; k < lgS; k++)
{
// cerr << "\n\n\n";
// cerr << "k = " << k << '\n';
// cerr << "X = " << X << '\n';
// cerr << "Z = " << Z << '\n';
if(pow2[k+1] <= Z) continue;
// cerr << "entered!\n";
// cerr << "Z = " << Z << '\n';
for(int e = lgN - 1; e >= 0; e--)
{
// cerr << X << ' ' << Z << ' ' << k << ' ' << e << ' ' << min_change[X][k][e] << ' ' << nxt[X][k][e] << ' ' << gain[X][k][e] << '\n';
if(Z >= min_change[X][k][e]) continue;
// cerr << "done!\n";
Z += gain[X][k][e];
X = nxt[X][k][e];
if(X == N) return Z;
}
// cerr << "Z = " << Z << '\n';
tle_assert(pow2[k] <= Z);
tle_assert(Z < pow2[k+1]);
if(Z >= S[X])
{
Z += S[X];
X = W[X];
}
else
{
Z += P[X];
X = L[X];
}
if(X == N) return Z;
tle_assert(pow2[k+1] <= Z);
// cerr << "after manual operation, Z = " << Z << '\n';
// cerr << "X = " << X << '\n';
}
return Z;
}
