제출 #1016652

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1016652		JakobZorz	던전 (IOI21_dungeons)	C++17	63 / 100	4112 ms	2097152 KiB

dungeons

#include"dungeons.h"
#include<vector>
#include<iostream>
typedef long long ll;
using namespace std;

int n;

struct Dungeon{
    vector<int>nxt1; // win
    vector<int>nxt2; // lose
    vector<ll>st1;  // strength
    vector<ll>st2;  // gain on losing
    vector<vector<int>>jmp; // where to jump?
    vector<vector<ll>>gain; // strength gain of that jump
    vector<vector<ll>>win;  // strength requirement to win in that jump
    int pw;
    ll thres=0;
    
    Dungeon(int n):nxt1(n),nxt2(n),st1(n),st2(n){}
    Dungeon()=default;
    
    void setup(){
        jmp=vector<vector<int>>(n+1,vector<int>(pw));
        gain=vector<vector<ll>>(n+1,vector<ll>(pw));
        win=vector<vector<ll>>(n+1,vector<ll>(pw));
        for(int p=0;p<pw;p++)
            jmp[n][p]=n;
        
        for(int i=0;i<n;i++){
            jmp[i][0]=nxt2[i];
            gain[i][0]=st2[i];
            win[i][0]=st1[i];
        }
            
        for(int p=1;p<pw;p++){
            for(int i=0;i<n;i++){
                jmp[i][p]=jmp[jmp[i][p-1]][p-1];
                gain[i][p]=gain[i][p-1]+gain[jmp[i][p-1]][p-1];
                win[i][p]=min(win[i][p-1],win[jmp[i][p-1]][p-1]-gain[i][p-1]);
            }
        }
    }
    
    // simulate until it either reaches n-th node, wins, or strength>=thres
    pair<int,ll>simulate(int x,ll st){
        for(int p=pw;p>=0;p--){
            if(jmp[x][p]!=n&&win[x][p]>st&&st+gain[x][p]<thres){
                st+=gain[x][p];
                x=jmp[x][p];
            }
        }
        // do 1 more jump
        if(st>=st1[x]){
            st+=st1[x];
            x=nxt1[x];
        }else{
            st+=st2[x];
            x=nxt2[x];
        }
        return{x,st};
    }
};

Dungeon dun[30];

void init(int N,vector<int>s,vector<int>p,vector<int>w,vector<int>l){
    n=N;
    
    for(int pw=0;pw<30;pw++){
        dun[pw]=Dungeon(n);
        dun[pw].thres=2LL<<pw;
        dun[pw].pw=pw+1;
        for(int i=0;i<n;i++){
            if(s[i]<=1<<pw){
                dun[pw].nxt1[i]=0;
                dun[pw].nxt2[i]=w[i];
                dun[pw].st1[i]=1e18;
                dun[pw].st2[i]=s[i];
            }else if(s[i]>=2<<pw){
                dun[pw].nxt1[i]=0;
                dun[pw].nxt2[i]=l[i];
                dun[pw].st1[i]=1e18;
                dun[pw].st2[i]=p[i];
            }else{
                dun[pw].nxt1[i]=w[i];
                dun[pw].nxt2[i]=l[i];
                dun[pw].st1[i]=s[i];
                dun[pw].st2[i]=p[i];
            }
        }
    }
    dun[29].thres=1e18;
    for(int pw=0;pw<30;pw++)
        dun[pw].setup();
}

ll simulate(int x,int z){
    ll st=z;
    
    for(int p=0;p<30;p++){
        while(x!=n&&st<2LL<<p){
            auto r=dun[p].simulate(x,st);
            x=r.first;
            st=r.second;
        }
    }
    
	return st;
}

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