제출 #676078

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
676078		ToroTN	Paprike (COI18_paprike)	C++14	13 / 100	48 ms	16424 KiB

paprike

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
int n,m,a[100005],u_i,v_i,sum[100005],cnt,total,ss,ans=0,w;
vector<int> v[100005];
priority_queue<int> pq;
void dfs(int u,int p)
{
    for(auto node:v[u])
    {
        if(node!=p)dfs(node,u);
    }
    if(v[u].size()==1&&u!=1)
    {
        sum[u]=a[u];
        //cout << "u=" << u << "||" << "sumu=" << sum[u]  << '\n';
    }else
    {
        
        if(u==1)
        {
            total=v[1].size();
        }else
        {
            total=v[u].size()-1;
        }
        cnt=a[u];
        //if(u==6)cout << u << '\n';
        for(auto node:v[u])
        {
            if(node!=p)
            {
                pq.push(-sum[node]);
                //if(u==6)cout << node << ' ' << sum[node] << '\n';
            }
        }
        ss=-1;
        while(!pq.empty())
        {
            w=-pq.top();
            cnt+=w;
            pq.pop();
            if(cnt>m)
            {
                cnt-=w;
                ss=pq.size()+1;
                break;
            }
        }
        sum[u]=cnt;
        if(ss==-1)ss=0;
        ans+=ss;
    }
}
int main()
{
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin >> n >> m;
    for(int i=1;i<=n;i++)cin >> a[i];
    for(int i=1;i<n;i++)
    {
        cin >> u_i >> v_i;
        v[u_i].pb(v_i);
        v[v_i].pb(u_i);
    }
    dfs(1,1);
    cout << ans;
}

• Subtask 1: 0 / 11
• Subtask 2: 13 / 13
• Subtask 3: 0 / 27
• Subtask 4: 0 / 49