제출 #1118368

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1118368		alexdd	Magic Tree (CEOI19_magictree)	C++17	100 / 100	136 ms	37720 KiB

magictree

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e9;
int n,m,k;
vector<int> con[100005];
int parent[100005];
int d[100005],w[100005];
map<int,int> dp[100005];///{poz,dif}
void dfs(int nod)
{
    int maxc=-1,heavy=-1;
    for(int adj:con[nod])
    {
        dfs(adj);
        ///for(int i=1;i<=k;i++)
           /// dp[nod][i] += dp[adj][i];
        if((int)dp[adj].size() > maxc)
            maxc = dp[adj].size(), heavy = adj;
    }
    ///dp[nod][d[nod]] += w[nod];
    ///for(int i=1;i<=k;i++) dp[nod][i] = max(dp[nod][i], dp[nod][i-1]);
    if(heavy==-1)
    {
        if(w[nod]) dp[nod][d[nod]] += w[nod];
    }
    else
    {
        swap(dp[nod], dp[heavy]);
        for(int adj:con[nod])
        {
            if(adj==heavy)
                continue;
            for(auto it:dp[adj])
            {
                dp[nod][it.first] += it.second;
            }
        }
        if(w[nod] > 0)
        {
            dp[nod][d[nod]] += w[nod];
            auto it = dp[nod].upper_bound(d[nod]);
            int cur = w[nod];
            while(it!=dp[nod].end())
            {
                if((*it).second < cur)
                {
                    cur -= (*it).second;
                    it = dp[nod].erase(it);
                }
                else
                {
                    pair<int,int> cop = *it;
                    dp[nod][cop.first] -= cur;
                    cur = 0;
                    break;
                }
            }
        }
    }
    /*cout<<nod<<":\n";
    for(auto it:s[nod])
        cout<<it.first.first<<" "<<it.first.second<<"   "<<it.second<<"\n";
    cout<<"\n\n\n";*/
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>m>>k;
    for(int i=2;i<=n;i++)
    {
        cin>>parent[i];
        con[parent[i]].push_back(i);
    }
    for(int i=1;i<=m;i++)
    {
        int x;
        cin>>x;
        cin>>d[x]>>w[x];
    }
    dfs(1);
    int sum=0,mxm=0;
    for(auto it:dp[1])
    {
        sum += it.second;
        mxm = max(mxm, sum);
    }
    cout<<mxm;
    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