Submission #242620

#	Time	Username	Problem	Language	Result	Execution time	Memory
242620		lyc	Magic Tree (CEOI19_magictree)	C++14	100 / 100	152 ms	26232 KiB

magictree

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

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for (int i=(a);i>=(b);--i)
using ll=long long;
using ii=pair<int,int>;

const int mxN = 1e5+5;

int N, M, K;
vector<int> al[mxN];
ii fruit[mxN];

map<int,ll> dfs(int u) {
    map<int,ll> res;
    for (int v : al[u]) {
        auto x = dfs(v);
        if (SZ(res) < SZ(x)) swap(res,x);
        for (auto& y : x) {
            if (res.count(y.first)) res[y.first] += y.second;
            else res.insert(y);
        }
    }
    if (fruit[u] != ii(-1,-1)) {
        auto it = res.upper_bound(fruit[u].first);
        if (it != res.begin() && prev(it)->first == fruit[u].first) {
            auto x = *prev(it);
            res.erase(prev(it));
            x.second += fruit[u].second;
            res.insert(x);
        } else res.insert(fruit[u]);
        for (ll y = fruit[u].second; y && it != res.end();) {
            auto x = *it;
            auto jt = next(it);
            res.erase(it);
            ll d = min(y,x.second);
            y -= d;
            x.second -= d;
            if (x.second) res.insert(x);
            it = jt;
        }
    }
    //cout << u << " :: ";
    //for (auto& x : res) cout << x.first << " " << x.second << " | ";
    //cout << endl;
    return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> N >> M >> K;
    FOR(i,2,N){
        int P; cin >> P;
        al[P].push_back(i);
    }
    FOR(i,1,N) fruit[i] = ii(-1,-1);
    FOR(i,1,M){
        int V, D, W; cin >> V >> D >> W;
        fruit[V] = ii(D,W);
    }

    auto res = dfs(1);
    ll ans = 0;
    for (auto& x : res) ans += x.second;
    cout << ans << '\n';
}

• Subtask 1: 6 / 6
• Subtask 2: 3 / 3
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 16 / 16
• Subtask 6: 13 / 13
• Subtask 7: 22 / 22
• Subtask 8: 17 / 17