# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438423 | mango_lassi | Dungeons Game (IOI21_dungeons) | C++17 | 7069 ms | 90540 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 "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e9 + 7;
const int N = 50000; // 4 * (int)1e5;
const int C = 4;
const int H = 24 / C;
pair<int, ll> jmp[N + 1][H][H];
ll str[N + 1];
ll bns[N + 1];
int wt[N + 1];
int lt[N + 1];
int n;
pair<int, ll> advance(pair<int, ll> cur) {
if (str[cur.first] > cur.second) return {lt[cur.first], bns[cur.first] + cur.second};
else return {wt[cur.first], str[cur.first] + cur.second};
}
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) str[i] = s[i];
for (int i = 0; i < n; ++i) bns[i] = p[i];
for (int i = 0; i < n; ++i) wt[i] = w[i];
for (int i = 0; i < n; ++i) lt[i] = l[i];
str[n] = 0;
bns[n] = 0;
wt[n] = n;
# | 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... |