# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445267 | BaraaArmoush | Dungeons Game (IOI21_dungeons) | C++17 | 2 ms | 588 KiB |
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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 50500;
int n;
int s[N];
int p[N];
int w[N];
int l[N];
int init(int n, vector<int> S, vector<int> P, vector<int> W, vector<int> L) {
::n = n;
copy(S.begin(), S.end(), s);
copy(P.begin(), P.end(), p);
copy(W.begin(), W.end(), w);
copy(L.begin(), L.end(), l);
}
ll simulate(int i, int z) {
ll x = z;
while (i < n) {
if (x >= s[i]) {
x += s[i];
i = w[i];
} else {
Compilation message (stderr)
# | 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... |