#include "dungeons.h"
#include <vector>
using namespace std;
int nn;
vector < int > a, b;
vector < int > win, lose;
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {
nn = n;
a.resize(n, 0);
b.resize(n, 0);
for (int i = 0; i < nn; ++ i)
a[i] = s[i];
for (int i = 0; i < nn; ++ i)
b[i] = p[i];
win.resize(n, 0);
lose.resize(n, 0);
for (int i = 0; i < nn; ++ i)
win[i] = w[i];
for (int i = 0; i < nn; ++ i)
lose[i] = l[i];
return;
}
long long rec(long long pos, long long s)
{
if(pos == nn)return s;
if(s >= a[pos])return rec(win[pos], s+a[pos]);
else return rec(lose[pos], s+b[pos]);
}
long long simulate(int x, int z)
{
return rec(x, z);
}
