제출 #1040452

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1040452		Alihan_8	던전 (IOI21_dungeons)	C++17	13 / 100	98 ms	32604 KiB

dungeons

#include "dungeons.h"
#include <vector>

#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
//#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

const i64 inf = 1e15;

const int L = 30;

vector <int> s, p, w, l;

vector <i64> sf;

vector <vector<i64>> up, sm;

int n;

void init(int n_, std::vector<int> s_, std::vector<int> p_, std::vector<int> w_, std::vector<int> l_) {
	n = n_, s = s_, p = p_, w = w_, l = l_;
	
	up.resize(n + 1), sm.resize(n + 1);
	
	sf.resize(n + 1);
	
	for ( int i = n - 1; i >= 0; i-- ){
		sf[i] = sf[w[i]] + 1;
	}
	
	for ( int i = 0; i <= n; i++ ){
		up[i].resize(L);
		sm[i].resize(L);
		
		if ( i < n ){
			up[i][0] = l[i];
			sm[i][0] = p[i];
		}
	}
	
	sm[n][0] = inf;
	up[n][0] = n;
	
	for ( int i = 1; i < L; i++ ){
		for ( int j = 0; j <= n; j++ ){
			up[j][i] = up[up[j][i - 1]][i - 1];
			sm[j][i] = sm[up[j][i - 1]][i - 1] + sm[j][i - 1];
			
			chmin(sm[j][i], inf);
		}
	}
}

long long simulate(int x, int z) {
	i64 cnt = z;
	
	for ( int i = L - 1; i >= 0; i-- ){
		if ( cnt + sm[x][i] < s[0] ){
			cnt += sm[x][i];
			
			x = up[x][i];
		}
	}
	
	if ( x < n && cnt < s[0] ){
		cnt += sm[x][0];
		
		x = up[x][0];
	}
	
	assert(cnt >= s[0] || x == n);
	
	return cnt + sf[x] * 1LL * s[0];
}

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