# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161381 | Wansur | Dungeons Game (IOI21_dungeons) | C++20 | 7102 ms | 1851768 KiB |
#include <bits/stdc++.h>
#include "dungeons.h"
#define ent '\n'
using namespace std;
typedef long long ll;
const int maxn = 4e5 + 12;
int s[maxn], p[maxn], w[maxn], l[maxn];
ll sum[10][26][maxn], mn[10][26][maxn];
int up[10][26][maxn];
ll pw[maxn];
int n;
void init(int N, vector<int> S, vector<int> P, vector<int> W, vector<int> L) {
n = N;
pw[0] = 2;
for(int i = 1; i < 9; i++) {
pw[i] = pw[i - 1] * 5;
}
for(int i = 0; i < n; i++) {
s[i] = S[i], p[i] = P[i];
w[i] = W[i], l[i] = L[i];
}
for(int b = 0; b < 9; b++) {
up[b][0][n] = n;
mn[b][0][n] = -1e18;
# | 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... |