제출 #720934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
720934		urosk	던전 (IOI21_dungeons)	C++17	37 / 100	7064 ms	1428968 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#define ll long long
#define llinf 1000000000000000000LL
#define pb push_back
using namespace std;
#define maxn 400005
#define lg 20
#define lg2 9
#define B 8
ll n;
int a[maxn],b[maxn],w[maxn],l[maxn];
ll bs[lg2];
int st[lg2][lg][maxn];
ll sum[lg2][lg][maxn];
ll mx[lg2][lg][maxn];
void init(int N, vector<int> s, vector<int> p, vector<int> W, vector<int> L) {
    bs[0] = 1;
    for(ll i = 1;i<lg2;i++) bs[i] = bs[i-1]*B;
	n = N;
	for(ll i = 1;i<=n;i++) a[i] = s[i-1];
	for(ll i = 1;i<=n;i++) b[i] = p[i-1];
	for(ll i = 1;i<=n;i++) w[i] = W[i-1]+1;
	for(ll i = 1;i<=n;i++) l[i] = L[i-1]+1;
    for(ll j = 0;j<lg2;j++){
        for(ll i = 1;i<=n;i++){
            if(bs[j]>a[i]){
                st[j][0][i] = w[i];
                sum[j][0][i] = a[i];
                mx[j][0][i] = llinf;
            }else{
                st[j][0][i] = l[i];
                sum[j][0][i] = b[i];
                mx[j][0][i] = a[i];
            }
        }
    }
    for(ll j = 0;j<lg2;j++){
        for(ll k = 1;k<lg;k++){
            for(ll i = 1;i<=n;i++){
                st[j][k][i] = st[j][k-1][st[j][k-1][i]];
                sum[j][k][i] = sum[j][k-1][i] + sum[j][k-1][st[j][k-1][i]];
                mx[j][k][i] = min(mx[j][k-1][i],mx[j][k-1][st[j][k-1][i]]-sum[j][k-1][i]);
            }
        }
    }
	return;
}

long long simulate(int x, int z) {
    x++;
    ll j = 0;
    while(x!=n+1){
        while(j+1<lg2&&bs[j+1]<=z) j++;
        for(ll k = lg-1;k>=0;k--){
            if(st[j][k][x]==n+1) continue;
            if(z>=mx[j][k][x]) continue;
            z+=sum[j][k][x];
            x = st[j][k][x];
        }
        if(z>=a[x]){
            z+=a[x];
            x = w[x];
        }else{
            z+=b[x];
            x = l[x];
        }
    }
    return z;
}
/**
3 2
2 6 9
3 1 2
2 2 3
1 0 1
0 1
2 3

3 2
9 9 9
3 1 2
2 2 3
1 0 1
0 1
2 3
**/

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