Submission #927836

#	Time	Username	Problem	Language	Result	Execution time	Memory
927836		12345678	Magic Tree (CEOI19_magictree)	C++17	100 / 100	93 ms	33588 KiB

magictree

#include <bits/stdc++.h>
 
using namespace std;
 
#define ll long long
 
const int nx=1e5+5;
ll n, m, k, t[nx], w[nx], p, l, res;
vector<int> d[nx];
map<ll, ll> dp[nx];

void dfs(int u)
{
    for (auto v:d[u])
    {
        dfs(v);
        if (dp[v].size()>dp[u].size()) swap(dp[u], dp[v]);
        for (auto [x, y]:dp[v]) dp[u][x]+=y;
        dp[v].clear();
    }
    int vl=w[u];
    dp[u][t[u]]+=w[u];
    for (auto itr=next(dp[u].find(t[u])); itr!=dp[u].end();)
    {
        if (vl>=itr->second) 
        {
            vl-=itr->second;
            itr=dp[u].erase(itr);
        }
        else {
            itr->second-=vl;
            break;
        }
    }
}
 
int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m>>k;
    for (int i=2; i<=n; i++) cin>>p, d[p].push_back(i);
    for (int i=1; i<=m; i++) cin>>l>>t[l]>>w[l];
    dfs(1);
    for (auto [x, y]:dp[1]) res+=y;
    cout<<res<<'\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