Submission #95354

#	Time	Username	Problem	Language	Result	Execution time	Memory
95354		dalgerok	Paprike (COI18_paprike)	C++14	100 / 100	71 ms	17724 KiB

paprike

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



const int N = 1e5 + 5;



int n, m, a[N], ans;
vector < int > g[N];

void dfs(int v, int pr = -1){
    vector < int > q;
    for(int to : g[v]){
        if(to != pr){
            dfs(to, v);
            q.push_back(a[to]);
        }
    }
    sort(q.begin(), q.end());
    for(auto it : q){
        if(a[v] + it > m){
            ans += 1;
        }
        else{
            a[v] += it;
        }
    }
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(int i = 1; i < n; i++){
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    dfs(1);
    cout << ans;
}

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