제출 #442823

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

dungeons

#include "dungeons.h"
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define int long long
// #define double long double
using pii = pair<int, int>;
template<typename T>
using Prior = std::priority_queue<T>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define eb emplace_back
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)

namespace {

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

// const int maxn = 4E5 + 5;
const int maxn = 5E4 + 5;
const int lgmx = 24 + 1;
const int maxlvl = 7 + 1;
const int INF = INT_MAX;

int N, tot_lvl;
vector<int> S, P, W, L, U;

int anc[maxlvl][lgmx][maxn], sum[maxlvl][lgmx][maxn];

} /// end of namespace

void init(int32_t _N, vector<int32_t> _S, vector<int32_t> _P, vector<int32_t> _W, vector<int32_t> _L) {
    N = _N;
    for (auto &x : _S) S.eb(x), U.eb(x);
    for (auto &x : _P) P.eb(x);
    for (auto &x : _W) W.eb(x);
    for (auto &x : _L) L.eb(x);
    S.eb(0), U.eb(INF), P.eb(0), W.eb(N), L.eb(N);
    
    sort(ALL(U));
    U.resize(unique(ALL(U)) - begin(U));
    tot_lvl = U.size();
    
    memset(anc, 0x00, sizeof(anc));
    memset(sum, 0x00, sizeof(sum));
    
    for (int lvl = 0; lvl < tot_lvl; ++lvl) {
        
        /// Assume you have strength in [U_{lvl-1}, U_{lvl}) ///
        
        for (int i = 0; i <= N; ++i) {
            anc[lvl][0][i] = S[i] < U[lvl] ? W[i] : L[i];
            sum[lvl][0][i] = S[i] < U[lvl] ? S[i] : P[i];
        }
        
        for (int lay = 1; lay < lgmx; ++lay) {
            for (int i = 0; i <= N; ++i) {
                int par = anc[lvl][lay-1][i];
                anc[lvl][lay][i] = anc[lvl][lay-1][par];
                sum[lvl][lay][i] = sum[lvl][lay-1][i] + sum[lvl][lay-1][par];
            }
        }
        
    }
}

int simulate(int32_t now, int32_t _Z) {
    int Z = _Z;
    for (int lvl = 0; lvl < tot_lvl; ++lvl) {
        for (int lay = lgmx-1; lay >= 0; --lay) {
            if (Z + sum[lvl][lay][now] < U[lvl]) {
                Z += sum[lvl][lay][now];
                now = anc[lvl][lay][now];
            }
        }
        // cerr << "(lvl, Z, now): " << lvl << "," << Z << "," << now << "\n";
        if (Z >= S[now]) Z += S[now], now = W[now];
        else             Z += P[now], now = L[now];
        // cerr << "(lvl, Z, now): " << lvl << "," << Z << "," << now << "\n";
    }
    return Z;
}

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