Submission #1284625

#	Time	Username	Problem	Language	Result	Execution time	Memory
1284625		Faggi	Dungeons Game (IOI21_dungeons)	C++20	0 / 100	2 ms	696 KiB

dungeons

#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define forn(i,n) for(i=0; i<n; i++)
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;

const int MAXN=4e1+1;
const int LOG=20;

ll up[MAXN][LOG], ma[MAXN][LOG], sum[MAXN][LOG];
vector<int>S,P,W,L;
int N;
void init(int n, std::vector<int> s, std::vector<int> p, std::vector<int> w, std::vector<int> l) {

    s.pb(0);
    p.pb(0);
    w.pb(n);
    l.pb(n);
    ll i, j;
    N=n;
    S=s;
    P=p;
    W=w;
    L=l;
    for(i=0; i<=n; i++)
    {
        up[i][0]=w[i];
        ma[i][0]=s[i];
        sum[i][0]=s[i];
    }

    for(i=1; i<LOG; i++)
    {
        for(j=0; j<=n; j++)
        {
            up[j][i]=up[up[j][i-1]][i-1];
            ma[j][i]=max(ma[j][i-1],ma[up[j][i-1]][i-1]);
            sum[j][i]=sum[j][i-1]+sum[up[j][i-1]][i-1];
            if(up[j][i-1]==n)
            {
                ma[j][i]=ma[j][i-1];  
                sum[j][i]=sum[j][i-1];
            }
        }
    }
	return;
}

long long simulate(int x, int z) {
    ll act=z, i, ult;
	while(x!=N)
    {
        if(1ll*S[x]>act)
        {
            act+=P[x];
            x=L[x];
        }
        else
        {
            ult=-1;
            for(i=0; i<LOG; i++)
            {
                if(ma[x][i]>act)
                    break;
                ult=i;
            }
            if(ult==-1)
            {
                act+=S[x];
                x=W[x];
                continue;
            }
            ll aux=sum[x][ult];
            act+=aux;
            x=up[x][ult];
            act+=S[x];
            x=W[x];
        }
    }
    return act; 
}

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