Submission #1043913

#	Time	Username	Problem	Language	Result	Execution time	Memory
1043913		vjudge1	Paprike (COI18_paprike)	C++17	24 / 100	66 ms	17592 KiB

paprike

#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;
int n, k, a[N], sz[N], ans;
vector<int> g[N];

void dfs(int v, int p = -1){
    vector<int> vec;
    sz[v] = a[v];
    for (int u : g[v]){
        if (u == p) continue;
        dfs(u, v);
        sz[v] += sz[u];
        vec.push_back(sz[u]);
    }
    sort(vec.begin(), vec.end());

    while (sz[v] > k){
        sz[v] -= vec.back();
        vec.pop_back();
        ans++;
    }
}

int main(){
    cin >> n >> k;
    for (int i = 1; i <= n; i ++)
        cin >> a[i];
    for (int i = 1; i < n; i ++){
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    dfs(1);
    cout << ans << endl;
}

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