Submission #928933

#	Time	Username	Problem	Language	Result	Execution time	Memory
928933		12345678	Paprike (COI18_paprike)	C++17	100 / 100	36 ms	19616 KiB

paprike

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=1e5+5;

ll n, k, dp[nx], u, v, res;
vector<int> d[nx];

void dfs(int u, int p)
{
    vector<int> tmp;
    for (auto v:d[u]) if (v!=p) dfs(v, u), tmp.push_back(dp[v]);
    sort(tmp.begin(), tmp.end());
    for (auto x:tmp)
    {
        if (dp[u]+x>k) res++;
        else dp[u]+=x;
    }
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>k;
    for (int i=1; i<=n; i++) cin>>dp[i];
    for (int i=0; i<n-1; i++) cin>>u>>v, d[u].push_back(v), d[v].push_back(u);
    dfs(1, 1);
    cout<<res;
}

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