#include "dungeons.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 4e5 + 8;
int n;
int s[N];
int p[N];
int w[N];
int l[N];
void init(int n_in, std::vector<int> s_in, std::vector<int> p_in, std::vector<int> w_in, std::vector<int> l_in) {
	n = n_in;
	for (int i=0; i<n; i++) {
		s[i] = s_in[i];
		p[i] = p_in[i];
		w[i] = w_in[i];
		l[i] = l_in[i];
	}
	return;
}
long long simulate(int x, int z) {
	int pos = x;
	ll str = z;
	while (pos != n) {
		if (str >= s[pos]) {
			str += s[pos];
			pos = w[pos];
		}
		else {
			str += p[pos];
			pos = l[pos];
		}
	}
	return str;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |