Submission #72965

#	Time	Username	Problem	Language	Result	Execution time	Memory
72965		badrovinho	Paprike (COI18_paprike)	C++14	11 / 100	13 ms	2236 KiB

paprike

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cstdlib>

using namespace std;

int n,k;
int rez=0;
int hljut[10005];
int a[10005];
int b[10005];
vector <int> graf[10005];

int dfs(int x, int par){
    vector <int> v;
    for (int i = 0; i < (int)(graf[x]).size(); i++){
        int child = graf[x][i];
        if (child == par)continue;
        v.push_back(dfs(child, x));
    }
    sort(v.begin(), v.end());
    int sum = 0;

    sum += hljut[x-1];

    for (int j = 0; j < v.size(); j++) sum += v[j];
    for (int i = v.size()-1; i >= 0; i--){
        if (sum>k){
            sum -= v[i];
            rez++;
        } else break;
    }
    return sum;
}

int main (){

    cin >> n >> k;
    for (int i=0; i<n; i++){
        cin >> hljut[i];
    }
    for (int i=0; i<n-1; i++){
        cin >> a[i] >> b[i];
        graf[a[i]].push_back(b[i]);
        graf[b[i]].push_back(a[i]);
    }
    dfs(1,0);
    cout << rez;
return 0;
}

Compilation message (stderr)

paprike.cpp: In function 'int dfs(int, int)':
paprike.cpp:29:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < v.size(); j++) sum += v[j];
                     ~~^~~~~~~~~~

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