# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1056056 | fuad27 | Dungeons Game (IOI21_dungeons) | C++17 | 7125 ms | 1948776 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;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
const int N = 4e5+1;
const int lg = 28;
const int lgb = 11;
const int base = 5;
const long long inf = 2e9;
int up[lg][N][lgb];
int min_diff[lg][N][lgb];
long long sum[lg][N][lgb];
int n;
vector<int> s, p, w, l;
void init(int nn, std::vector<int> ss, std::vector<int> pp,
std::vector<int> ww, std::vector<int> ll) {
s=ss, p = pp, w = ww, l = ll;
n = nn;
auto start = clock();
for(int _ = 0;_<lg;_++) {
for(int i = 0;i<=n;i++) {
if(i == n) {
up[_][i][0] = n;
min_diff[_][i][0] = inf;
sum[_][i][0] = 0;
}
else if(s[i] < (1ll<<_)) {
up[_][i][0] = w[i];
min_diff[_][i][0] = inf;
# | 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... |