# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
437156 | 2021-06-26T00:23:36 Z | MilosMilutinovic | Dungeons Game (IOI21_dungeons) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; const int maxn = 4e5 + 5; int n, s[maxn], p[maxn], w[maxn], l[maxn]; void init(int N, int* S, int* P, int* W, int* L) { n = N; for (int i = 0; i < N; i++) { s[i] = S[i]; p[i] = P[i]; w[i] = W[i]; l[i] = L[i]; } } long long simulate(int x, int z) { while (x < n) { if (z >= s[x]) { z += s[x]; x = w[x]; } else { z += p[x]; x = l[x]; } } return z; }