| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1056363 | Huseyn123 | Dungeons Game (IOI21_dungeons) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
#include "dungeons.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define INF LLONG_MAX
using namespace std;
typedef long long ll;
const int lgb=3;
const int lg=12;
ll st0[lg][25][400001];
ll st1[lg][25][400001];
int st2[lg][25][400001];
vector<int> S,P,W,L;
int N;
void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
s.push_back(0);
N=n;
S=s;
P=p;
W=w;
L=l;
for(int i=0;i<lg;i++){
for(int z=0;z<n;z++){
if(s[z]<(1<<i)){
st0[i][0][z]=s[z];
if(w[z]!=n && s[w[z]]<(1<<i)){
st1[i][0][z]=-INF;
}
else{
st1[i][0][z]=s[z]-s[w[z]];