Submission #1293803

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293803		ayxanesedzade10	Paprike (COI18_paprike)	C++20	100 / 100	85 ms	18268 KiB

paprike

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define ld long double
using namespace std;
const ll sz=1e5+100;
vector<ll>v[sz];
ll used[sz],h[sz],sum[sz],cnt=0,n,k;
void dfs(ll u)
{
    used[u]=1;
    sum[u]+=h[u];
    vector<ll>ed;
    for(auto to:v[u]){
        if(used[to]) continue;
        dfs(to);
        ed.pb(sum[to]);
    }
    sort(all(ed));
    for(int i=0;i<ed.size();i++){
        if(sum[u]+ed[i]<=k){
            sum[u]+=ed[i];
        }
        else cnt++;
    }
}
int main()
{
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>h[i];
    }
    for(int i=1;i<n;i++){
        ll a,b;cin>>a>>b;
        v[a].pb(b);
        v[b].pb(a);
    }
    dfs(1);
    cout<<cnt<<endl;
}

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