Submission #1261406

#	Time	Username	Problem	Language	Result	Execution time	Memory
1261406		chikien2009	Magic Tree (CEOI19_magictree)	C++20	100 / 100	71 ms	32324 KiB

magictree

#include <bits/stdc++.h>

using namespace std;

void setup()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int n, m, k, a, b[100000], c[100000];
vector<int> g[100000];
long long res;
map<int, long long> mx;

inline map<int, long long> DFS(int node)
{
    map<int, long long> cur, temp;
    map<int, long long>::iterator pos;
    for (auto &i : g[node])
    {
        temp = DFS(i);
        if (temp.size() > cur.size())
        {
            swap(temp, cur);
        }
        for (auto &j : temp)
        {
            cur[j.first] += j.second;
        }
    }
    if (c[node] > 0)
    {
        cur[b[node]] += c[node];
        pos = cur.upper_bound(b[node]);
        while (pos != cur.end())
        {
            if ((*pos).second > c[node])
            {
                (*pos).second -= c[node];
                break;
            }
            else
            {
                c[node] -= (*pos).second;
                pos = cur.erase(pos);
            }
        }
    }
    return cur;
}

int main()
{
    setup();

    cin >> n >> m >> k;
    for (int i = 1; i < n; ++i)
    {
        cin >> a;
        g[a - 1].push_back(i);
    }
    while (m--)
    {
        cin >> a >> b[a - 1] >> c[a - 1];
    }
    mx = DFS(0);
    for (auto & i : mx)
    {
        res += i.second;
    }
    cout << res;
    return 0;
}

• 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