Submission #439887

#	Time	Username	Problem	Language	Result	Execution time	Memory
439887		phathnv	Dungeons Game (IOI21_dungeons)	C++17	100 / 100	6154 ms	1302388 KiB

dungeons

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

using namespace std;

const int N = 4e5 + 7;
const int L4 = 7;
const int L2 = 24;

int n;
vector<int> s, p, w, l;
int nxt[L4][L2][N];
long long f[L4][L2][N], sum[L4][L2][N];

void init(int _n, vector<int> _s, vector<int> _p, vector<int> _w, vector<int> _l) {
    n = _n;
    s = _s;
    p = _p;
    w = _w;
    l = _l;
    for (int b = 0; b < L4; b++) {
        for (int i = 0; i < n; i++) {
            nxt[b][0][i] = (s[i] <= (1 << (4 * b))? w[i] : l[i]);
            sum[b][0][i] = (s[i] <= (1 << (4 * b))? s[i] : p[i]);
            f[b][0][i] = (s[i] < (1 << (4 * b))? 1e18 : s[i]);
        }
        nxt[b][0][n] = -1;
        for (int i = 1; i < L2; i++)
            for (int j = 0; j <= n; j++) {
                nxt[b][i][j] = (nxt[b][i - 1][j] == -1? -1 : nxt[b][i - 1][nxt[b][i - 1][j]]);
                if (nxt[b][i][j] != -1) {
                    sum[b][i][j] = sum[b][i - 1][j] + sum[b][i - 1][nxt[b][i - 1][j]];
                    f[b][i][j] = min(f[b][i - 1][j], f[b][i - 1][nxt[b][i - 1][j]] - sum[b][i - 1][j]);
                }
            }
    }
	return;
}

long long simulate(int x, int _z) {
    long long z = _z;
    int b = 0;
    while (b < L4) {
        if (z >= (1 << (4 * (b + 1)))) {
            b++;
            continue;
        }
        for (int i = L2 - 1; i >= 0; i--) {
            if (nxt[b][i][x] == -1)
                continue;
            if (z < f[b][i][x]) {
                z += sum[b][i][x];
                x = nxt[b][i][x];
            }
        }
        if (x == n)
            return z;
        assert(z >= s[x]);
        z += s[x];
        x = w[x];
    }
    for (int i = L2 - 1; i >= 0; i--)
        if (nxt[L4 - 1][i][x] != -1) {
            z += sum[L4 - 1][i][x];
            x = nxt[L4 - 1][i][x];
        }
    assert(x == n);
	return z;
}

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