Submission #444103

#	Time	Username	Problem	Language	Result	Execution time	Memory
444103		leinad2	Dungeons Game (IOI21_dungeons)	C++17	37 / 100	7095 ms	125392 KiB

dungeons

#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);S.push_back(0);
    for(i=n-1;i>=0;i--)A[i]=A[W[i]]+S[i];
    A[n]=9e18;
    for(i=0;i<=n;i++)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;i++)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=W[x];
        }
    }
    return z;
}

• Subtask 1: 11 / 11
• Subtask 2: 26 / 26
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 27
• Subtask 6: 0 / 11