| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 609616 | FEDIKUS | 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"
using namespace std;
typedef long long ll;
const int logg=24;
const int maxn=4e5+10;
struct{
ll gain,max;
int pos;
} lift[maxn][logg][logg];
int n;
vector<int> s,p;
vector<int> w,l;
void init(int nn, vector<int> ss, vector<int> pp, vector<int> ww, vector<int> ll) {
n=nn; s=ss; p=pp; w=ww; l=ll;
s.resize(n+1); p.resize(n+1); w.resize(n+1), l.resize(n+1);
s[n]=0; p[n]=0; w[n]=n; l[n]=n;
for(int bit=0;bit<logg;bit++){
for(int jump=0;jump<logg;jump++){
for(int pos=0;pos<=n;pos++){
if(jump==0){
if((1<<bit)>=s[pos]) lift[pos][bit][jump]={s[pos],LLONG_MIN,w[pos]};
else lift[pos][bit][jump]={p[pos],-s[pos],l[pos]};
}else{
lift[pos][bit][jump]={lift[pos][bit][jump-1].gain+lift[lift[pos][bit][jump-1].pos][bit][jump-1].gain,
max(lift[pos][bit][jump-1].max,lift[pos][bit][jump-1].gain+lift[lift[pos][bit][jump-1].pos][bit][jump-1].max),
lift[lift[pos][bit][jump-1].pos][bit][jump-1].pos};
}
}
}
}
return;
}
int get_bit(ll a){
return min(63-__builtin_clzll(a),logg-1);
}
long long simulate(int x, int z) {
long long res=z;
while(true){
if(res==0){
res=p[x];
x=l[x];
continue;
}
int bit=get_bit(res);
for(int jump=logg-1;jump>=0;jump--){
if(res+lift[x][bit][jump].max<0){
res+=lift[x][bit][jump].gain;
x=lift[x][bit][jump].pos;
}
}
if((1LL<<bit)<s[x] && res>=s[x]){
res+=s[x];
x=w[x];
}
if(x==n) break;
}
return res;
}