This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using LL = long long;
int n;
vi s, p, w, l;
void init(int n, vi s, vi p, vi w, vi l) {
::n = n, ::s = s, ::p = p, ::w = w, ::l = l;
}
LL simulate(int x, int z) {
int i = x;
while (i != n) {
if (z >= s[i]) {
z += s[i];
i = w[i];
} else {
z += p[i];
i = l[i];
}
}
return z;
}
# | 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... |