제출 #72967

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
72967		badrovinho	Paprike (COI18_paprike)	C++14	38 / 100	9 ms	1504 KiB

paprike

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

using namespace std;

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

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

    sum += hljut[x-1];

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

int main (){

    cin >> n >> k;
    for (long long i=0; i<n; i++){
        cin >> hljut[i];
    }
    for (long long 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;
}

컴파일 시 표준 에러 (stderr) 메시지

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

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