제출 #928050

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928050		bobbilyking	던전 (IOI21_dungeons)	C++17	11 / 100	7058 ms	38956 KiB

dungeons

#include "dungeons.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long ;
#define A(a) (a).begin(), (a).end()
using pl = pair<ll, ll>;
using vl = vector<ll>;
#define F(i, l, r) for (ll i = (l); i < (r); ++i)
#define FD(i, l, r) for (ll i = (l); i > (r); --i)
#define K first
#define V second

const ll NN = 50010;
const ll SN = 0;
ll n;

ll s[NN], p[NN], w[NN], l[NN];
bool big[NN];

pl ans[NN]; // {minimum strength needed to clear to root, bonus delta }

void init(int _n, vector<int> _s, vector<int> _p, vector<int> _w, vector<int> _l) {
    n = _n;
    copy(A(_s), s);
    copy(A(_p), p);
    copy(A(_w), w);
    copy(A(_l), l);

    // precomp ans
    FD(i, n-1, -1) {
        ans[i].K = max(s[i], ans[w[i]].K - s[i]);   
        ans[i].V = ans[w[i]].V + s[i];
    }

}

long long simulate(int _x, int _z) {
    ll x = _x, z = _z;
    while (x - n and z <= SN) {
        if (z >= s[x]) z += s[x], x = w[x];
        else z += p[x], x = l[x];
    }

    if (x == n) return z;

    // TODO: implement some kind of bsearch dictating how far to go 

    // dummy code 
    {
        while (x - n and ans[x].K > z) {
            if (z >= s[x]) z += s[x], x = w[x];
            else z += p[x], x = l[x];
        }

        if (x == n) return z;

        return ans[x].V + z;
    }

}

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