Submission #1293815

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293815		okahak71	Paprike (COI18_paprike)	C++20	13 / 100	33 ms	20756 KiB

paprike

#include <bits/stdc++.h>
#define ll long long
#define vec vector
#define pb push_back
#define pll array<ll, 2>
#define all(X) X.begin(), X.end()
#define allr(X) X.rbegin(), X.rend()
using namespace std;

const ll inf = 1e18;

ll res = 0, k;
vec<vec<ll>>g;
vec<ll>sp;

void dfs(ll u, ll p){
    multiset<ll>st;
    for(ll &v : g[u]){
        if(v != p){
            dfs(v, u);
            st.insert(v);
        }
    }
    if(st.empty()) return ;
    ll add = st.size();
    for(ll v : st){
        //cout << sp[v] << ' ' << sp[u] << " " << add << endl;
        if(sp[v] + sp[u] <= k) sp[u] += sp[v], add--;
        else break;
    } res += add; 
}

void _(){
    ll n; cin >> n >> k;
    g.assign(n + 1, {}); sp.resize(n + 1, 0);
    for(ll i = 1; i <= n; i++) cin >> sp[i];
    for(ll i = 1; i < n; i++){
        ll a, b; cin >> a >> b;
        g[a].pb(b), g[b].pb(a);
    }
    dfs(1, 0); cout << res << endl;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0); _();
}

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