# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444094 | leinad2 | Dungeons Game (IOI21_dungeons) | C++17 | 7039 ms | 15580 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;
int N, i, j, sparse2[400010][20];
long long A[400010], sparse[400010][20];
vector<int>S, P, W, L;
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;W.push_back(N);
for(i=n-1;i>=0;i--)A[i]=A[W[i]]+S[i];
for(i=n-1;i>=0;i--)A[i];
A[n]=9e18;
for(i=0;i++<n;)sparse[i][0]=A[W[i]]+S[W[i]],sparse2[i][0]=W[i];
for(j=1;j<20;j++)for(i=0;i++<n;)sparse[i][j]=max(sparse[i][j-1], sparse[sparse2[i][j-1]][j-1]),sparse2[i][j]=sparse2[sparse2[i][j-1]][j-1];
}
long long simulate(int x, int Z)
{
long long z=Z;
while(x<N)
{
if(z<S[x])goto w;
for(j=19;j>=0;j--)
{
if(sparse[x][j]>z+A[x])continue;
z+=(A[x]-A[sparse2[x][j]]);x=sparse2[x][j];
}
w:;
if(z<S[x])
{
z+=P[x];
x=L[x];
}
else
{
z+=S[x];
x=S[x];
}
}
return z;
}
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... |