#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 5e4+10, logn = 25;
constexpr long long inf = 1e15L;
struct FunctionalGraph {
int f[maxn][logn], mn[maxn][logn];
long long tab[maxn][logn], cost[maxn][logn];
void add_i(int i, int x, int v, long long st) { f[i][0] = x, cost[i][0] = v, mn[i][0] = i, tab[i][0] = st; }
void build(int n) {
f[n][0] = n;
cost[n][0] = 0;
mn[n][0] = n;
for(int l = 1; l < logn; l++) {
for(int i = 0; i <= n; i++) {
f[i][l] = f[f[i][l-1]][l-1];
cost[i][l] = cost[i][l-1] + cost[f[i][l-1]][l-1];
if(tab[i][l-1] <= tab[f[i][l-1]][l-1] - cost[i][l-1])
mn[i][l] = mn[i][l-1], tab[i][l] = tab[i][l-1];
else
mn[i][l] = mn[f[i][l-1]][l-1], tab[i][l] = tab[f[i][l-1]][l-1];
}
}
}
void go(int& x, long long& val) {
if(val >= tab[x][0]) return;
for(int l = logn-1; l >= 0; l--)
if(mn[x][l] > val) val += cost[x][l], x = f[x][l];
val += cost[x][0], x = f[x][0];
}
} graph[logn];
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
for(int lg = 0; lg < logn; lg++) {
for(int i = 0; i < n; i++) {
if(s[i] <= (1<<lg)) graph[lg].add_i(i, w[i], s[i], inf);
else graph[lg].add_i(i, l[i], p[i], s[i]);
}
graph[lg].build(n);
}
return;
}
long long simulate(int x, int z) {
long long val = z;
for(int lg = 0; lg < logn; lg++)
graph[lg].go(x, val);
return val;
}
