제출 #754881

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
754881		Rafi22	Dungeons Game (IOI21_dungeons)	C++17	11 / 100	7082 ms	964032 KiB

dungeons

#include <bits/stdc++.h>

using namespace std;

//#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

const int N=50007,K=24;

int g[N][K][K];
ll mx[N][K][K];
ll sum[N][K][K];
vector<int>S,P,W,L;
int n;

void init(int nn,vector<int>s,vector<int>p,vector<int>w,vector<int>l)
{
    n=nn;
    s.pb(0);
    p.pb(0);
    w.pb(n);
    l.pb(n);
    S=s,P=p,W=w;L=l;
    for(int j=0;j<K;j++)
    {
        for(int i=0;i<=n;i++)
        {
            if(s[i]<(1<<j))
            {
                g[i][j][0]=w[i];
                sum[i][j][0]=s[i];
                mx[i][j][0]=-infl;
            }
            else
            {
                g[i][j][0]=l[i];
                sum[i][j][0]=p[i];
                mx[i][j][0]=-s[i];
            }
        }
        for(int l=1;l<K;l++)
        {
            for(int i=0;i<=n;i++)
            {
                int x=g[i][j][l-1];
                g[i][j][l]=g[x][j][l-1];
                sum[i][j][l]=sum[i][j][l-1]+sum[x][j][l-1];
                mx[i][j][l]=max(mx[i][j][l-1],sum[i][j][l-1]+mx[x][j][l-1]);
            }
        }
    }
}
ll simulate(int x,int z)
{
    ll a=z;
    int j=0;
    while(x!=n)
    {
        for(int l=K-1;l>=0;l--)
        {
            while(a>=(1<<(j+1))) j++;
            if(g[x][j][l]==n||a+mx[x][j][l]>=0) continue;
            a+=sum[x][j][l];
            x=g[x][j][l];
            //cout<<x<<" "<<a<<endl;
        }
        if(a>=S[x])
        {
            a+=S[x];
            x=W[x];
        }
        else
        {
            a+=P[x];
            x=L[x];
        }
        while(a>=(1<<(j+1))) j++;
    }
    return a;
}

/*int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    init(3,{2, 6, 9},{3, 1, 2},{2, 2, 3},{1, 0, 1});
    cout<<simulate(0,1)<<endl;
    cout<<simulate(2,3)<<endl;

    return 0;
}*/

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