제출 #723583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
723583		drdilyor	Magic Tree (CEOI19_magictree)	C++17	22 / 100	463 ms	1048576 KiB

magictree

#include<bits/stdc++.h>

using namespace std;
using ll = long long;


int main() {
    int n, m, k;
    cin >> n >> m >> k;

    vector<vector<int>> child(n);
    vector par(n, -1);
    for (int i = 1; i < n; i++) {
        cin >> par[i];
        child[--par[i]].push_back(i);
    }

    vector<vector<pair<int,ll>>> fruit(n);
    for (int i = 0; i < m; i++) {
        int v, d, w;
        cin >> v >> d >> w;
        fruit[v-1].push_back({d, w});
    }
    for (int i = 0; i < m; i++) {
        sort(fruit[i].begin(), fruit[i].end());
        for (int j = 1; j < (int)fruit[i].size(); j++) {
            fruit[i][j].second += fruit[i][j-1].second;
        }
    }

    auto chop = [&](int i, int day)->ll{
        auto ub = lower_bound(fruit[i].begin(), fruit[i].end(), pair{day+1, -1ll});
        auto lb = lower_bound(fruit[i].begin(), fruit[i].end(), pair{day, -1ll});
        if (ub == fruit[i].begin()) return 0;
        ub--;
        if (lb == fruit[i].begin()) return ub->second;
        return ub->second - (lb-1)->second;
    };


    vector memo(n, vector(k+1, -1));
    auto dp = [&](auto& dp, int i, int day)->ll{
        if (day == 0) return 0;
        if (memo[i][day] !=-1) return memo[i][day];
        ll res1 = chop(i, day);
        for (int e : child[i]) {
            res1 += dp(dp, e, day);
        }
        return memo[i][day] = max(res1, dp(dp, i, day-1));
    };
    cout << dp(dp, 0, k) << '\n';
}

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