| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 929727 | abcvuitunggio | 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 "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
const int base=5,sz=12;
int N,nxt[24][400001][sz],mn[24][400001][sz];
long long sum[24][400001][sz];
vector <int> S,P,W,L,ve={1};
void init(int n, vector <int> s, vector <int> p, vector <int> w, vector <int> l){
N=n,S=s,P=p,W=w,L=l;
for (int i=1;i<sz-1;i++)
ve.push_back(ve.back()*base);
ve.push_back(10000001);
memset(nxt,-1,sizeof(nxt));
for (int i=0;i<n;i++){
for (int j=0;j<sz;j++)
if (s[i]<=ve[j]){
nxt[0][i][j]=w[i];
sum[0][i][j]=s[i];
mn[0][i][j]=1e9;
}
else{
nxt[0][i][j]=l[i];
sum[0][i][j]=p[i];
mn[0][i][j]=s[i];
}
nxt[0][i][sz]=w[i];
}
for (int j=1;j<24;j++){
for (int i=0;i<n;i++)
for (int k=0;k<sz;k++){
if (nxt[j-1][i][k]==-1)
continue;
int u=nxt[j-1][i][k];
nxt[j][i][k]=nxt[j-1][u][k];
mn[j][i][k]=min(mn[j-1][i][k],(int)max(mn[j-1][u][k]-sum[j-1][i][k],0LL));
sum[j][i][k]=sum[j-1][i][k]+sum[j-1][u][k];
}
}
}
long long simulate(int x, int Z){
int cur=0;
long long z=Z;
while (x<N){
while (cur<sz&&ve[cur]<=z)
cur++;
if (cur==sz)
break;
int j=cur-1;
for (int i=23;i>=0;i--)
if (nxt[i][x][j]!=-1&&z<mn[i][x][j]){
z+=sum[i][x][j];
x=nxt[i][x][j];
}
if (x==N)
break;
if (z<S[x]){
z+=P[x];
x=L[x];
}
else{
z+=S[x];
x=W[x];
}
}
int j=cur-1;
for (int i=18;i>=0;i--)
if (nxt[i][x][j]!=-1){
z+=sum[i][x][j];
x=nxt[i][x][j];
}
return z;
}
\