Submission #1237124

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237124		ericl23302	Tree (IOI24_tree)	C++20	10 / 100	2096 ms	23184 KiB

tree

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

using namespace std;

typedef long long ll;

int n;
std::vector<ll> w;
vector<vector<int>> adjacency;

void init(std::vector<int> P, std::vector<int> W) {
    for (auto &i : W) w.push_back(i);
    n = (int)w.size();
    adjacency.resize(n);
    for (int i = 1; i < n; ++i) adjacency[P[i]].push_back(i);
}

pair<ll, ll> recurse(int cur, ll l, ll r) {
    if (adjacency[cur].size() == 0) return {l, l * w[cur]};
    ll tot = 0, res = 0;
    for (auto &child : adjacency[cur]) {
        auto curRes = recurse(child, l, r);
        tot += curRes.first;
        res += curRes.second;
    }

    if (tot > r) res += (tot - r) * w[cur], tot = r;
    return {tot, res};
}

long long query(int L, int R) {
    return recurse(0, L, R).second;
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 18
• Subtask 4: 0 / 7
• Subtask 5: 0 / 11
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19