제출 #1053323

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

dungeons

#include <bits/stdc++.h>
#include "dungeons.h"
using namespace std;

typedef long long ll;

ll n;
vector<int> p, w, l;
ll s;
vector<vector<pair<ll, ll>>> jmp;
vector<ll> dp;

void init(int n1, vector<int> s1, vector<int> p1, vector<int> w1, vector<int> l1) {
    n = n1; s = s1[0]; p = p1; w = w1; l = l1;
    jmp = vector<vector<pair<ll, ll>>>(n, vector<pair<ll, ll>>(30));
    for (int i = 0; i < n; i++) {
        jmp[i][0] = {p[i], l[i]};
        if (jmp[i][0].second == n) jmp[i][0].first = 1ll << 31ll;
    }
    for (int j = 1; j < 30; j++) {
        for (int i = 0; i < n; i++) {
            if (jmp[i][j-1].second == n) {
                jmp[i][j] = {1ll << 31ll, n};
                continue;
            }
            if (jmp[jmp[i][j-1].second][j-1].second == n) {
                jmp[i][j] = {1ll << 31ll, n};
                continue;
            }
            jmp[i][j] = {jmp[jmp[i][j-1].second][j-1].first + jmp[i][j-1].first,
                         jmp[jmp[i][j-1].second][j-1].second};
        }
    }
    dp = vector<ll>(n+1);
    dp[n] = 0;
    for (int i = n-1; i >= 0; i--) {
        dp[i] = s + dp[w[i]];
    }
}

ll simulate(int x1, int z1) {
	ll i = x1, z = z1;
    if (i == n || z >= s) return z + dp[i];
    for (int j = 30-1; j >= 0; j--) {
        if (z + jmp[i][j].first < s) {
            z += jmp[i][j].first;
            i = jmp[i][j].second;
        }
    }
    while (z < s) {
        z += p[i];
        i = l[i];
    }
    z += dp[i];
    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