Submission #1161321

#	Time	Username	Problem	Language	Result	Execution time	Memory
1161321		Wansur	Dungeons Game (IOI21_dungeons)	C++20	50 / 100	7097 ms	771456 KiB

dungeons

#include <bits/stdc++.h>
#include "dungeons.h"

#define ent '\n'

using namespace std;

typedef long long ll;

const int maxn = 4e5 + 12;

int s[maxn], p[maxn], w[maxn], l[maxn];
ll sum[40][maxn], up[40][maxn], mx[40][maxn];
ll sum_mn[40][maxn], up_mn[40][maxn], mn[40][maxn];
int n;

void init(int N, vector<int> S, vector<int> P, vector<int> W, vector<int> L) {
    n = N;
    up[0][n] = up_mn[0][n] = n;
    mx[0][n] = 1e18, mn[0][n] = -1e18;
    for(int i = 0; i < n; i++) {
        up[0][i] = W[i];
        sum[0][i] = S[i], mx[0][i] = S[i];
        up_mn[0][i] = L[i];
        sum_mn[0][i] = P[i], mn[0][i] = S[i];
        s[i] = S[i], p[i] = P[i];
        w[i] = W[i], l[i] = L[i];
    }

    for(int k = 1; k < 40; k++) {
        for(int i = 0; i <= n; i++) {
            up[k][i] = up[k - 1][up[k - 1][i]];
            sum[k][i] = sum[k - 1][i] + sum[k - 1][up[k - 1][i]];
            mx[k][i] = max(mx[k - 1][i], mx[k - 1][up[k - 1][i]] - sum[k - 1][i]);

            up_mn[k][i] = up_mn[k - 1][up_mn[k - 1][i]];
            sum_mn[k][i] = sum_mn[k - 1][i] + sum_mn[k - 1][up_mn[k - 1][i]];
            mn[k][i] = min(mn[k - 1][i], mn[k - 1][up_mn[k - 1][i]] - sum_mn[k - 1][i]);
        }
    }
}

ll simulate(int x, int val) {
    ll cur = val;

    while(x < n) {
        for(int i = 25 ; i >= 0; i--) {
            if(mx[i][x] <= cur) {
                cur += sum[i][x];
                x = up[i][x];
            }
        }
        if(x == n) break;
        assert(s[x] > cur);
        for(int i = 25; i >= 0; i--) {
            if(mn[i][x] > cur) {
                cur += sum_mn[i][x];
                x = up_mn[i][x];
            }
        }
        if(x == n) break;
        assert(s[x] <= cur);
    }
    return cur;
}

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