제출 #1016603

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

dungeons

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

int n;

struct Dungeon{
    vector<int>nxt1; // win
    vector<int>nxt2; // lose
    vector<int>st1;  // strength
    vector<int>st2;  // gain on losing
    ll thres=0;
    
    Dungeon(int n):nxt1(n),nxt2(n),st1(n),st2(n){}
    Dungeon()=default;
    
    
    // simulate until it either reaches n-th node, wins, or strength>=thres
    pair<int,ll>simulate(int x,ll st){
        while(st<thres&&x!=n){
            if(st>st1[x]){
                st+=st1[x];
                x=nxt1[x];
                break;
            }
            st+=st2[x];
            x=nxt2[x];
        }
        return{x,st};
    }
};

Dungeon dun;

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

ll simulate(int x,int z){
    ll st=z;
    
    while(x!=n){
        auto r=dun.simulate(x,st);
        x=r.first;
        st=r.second;
    }
    
	return st;
}

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