Submission #437157

#	Time	Username	Problem	Language	Result	Execution time	Memory
437157		MilosMilutinovic	Dungeons Game (IOI21_dungeons)	C++17	11 / 100	7089 ms	19768 KiB

dungeons

#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, vector<int> S, vector<int> P, vector<int> W, vector<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;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 26
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 27
• Subtask 6: 0 / 11