Submission #613585

#	Time	Username	Problem	Language	Result	Execution time	Memory
613585		dxz05	Dungeons Game (IOI21_dungeons)	C++17	0 / 100	293 ms	121992 KiB

dungeons

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

using namespace std;
typedef long long ll;

const int N = 400010;
const int LG = 25;

int up[N][LG];
ll sum[N][LG];
int dp[N];
int S;

void init(int n, vector<int> s, vector<int> p, vector<int> w, vector<int> l) {
	S = s[0];
    dp[n] = 0;
    for (int i = n - 1; i >= 0; i--) dp[i] = dp[w[i]] + 1;

    for (int i = 0; i < n; i++){
        up[i][0] = l[i];
        sum[i][0] = p[i];
    }

    for (int j = 1; j < LG; j++){
        for (int i = 0; i < N; i++){
            int x = up[i][j - 1];
            up[i][j] = up[x][j - 1];
            sum[i][j] = sum[i][j - 1] + sum[x][j - 1];
        }
    }
    return;
}

pair<int, ll> ancestor(int x, int k){
    ll res = 0;
    for (int i = LG - 1; i >= 0; i--){
        if (k & (1 << i)){
            res += sum[x][i];
            x = up[x][i];
        }
    }
    return make_pair(x, res);
}

long long simulate(int x, int z) {
	if (z >= S) return z + dp[x] * S;
    
    int l = 0, r = 2e7;
    while (l <= r){
        int m = (l + r) >> 1;
        pair<int, ll> res = ancestor(x, m);
        if (z + res.second >= S){
            r = m - 1;
        } else {
            l = m + 1;
        }
    }

    r++;
    pair<int, ll> res = ancestor(x, r);
    return z + res.second + dp[res.first] * S;
}

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