# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1117477 | welleyth | Dungeons Game (IOI21_dungeons) | C++17 | 3040 ms | 2072136 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;
constexpr int N = (int)4e5+1;
constexpr int K = 20;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
int s[N],p[N],w[N],l[N];
int n;
int go[K][K][N];
int sum[K][K][N];
long long goWin[N];
bool win[K][K][N];
int maxPref[K][K][N];
vector<int> SValues;
int norm(long long x){
if(x > (int)2e9) return (int)2e9;
else return x;
}
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];
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... |