oj.uz

답안 #72966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
72966 2018-08-27T10:25:11 Z badrovinho Paprike (COI18_paprike) C++14
38 / 100
 8 ms 1444 KB 
#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 (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

paprike.cpp: In function 'int dfs(long long int, long long 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.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 732 KB Output is correct
3 Correct 2 ms 816 KB Output is correct
4 Correct 2 ms 816 KB Output is correct
5 Correct 2 ms 816 KB Output is correct
6 Correct 3 ms 816 KB Output is correct
7 Correct 2 ms 828 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 3 ms 828 KB Output is correct
10 Correct 2 ms 828 KB Output is correct
11 Correct 2 ms 844 KB Output is correct
12 Correct 2 ms 844 KB Output is correct
13 Correct 2 ms 848 KB Output is correct
14 Correct 2 ms 848 KB Output is correct
15 Correct 2 ms 848 KB Output is correct
16 Correct 2 ms 848 KB Output is correct
17 Correct 2 ms 848 KB Output is correct
18 Correct 2 ms 848 KB Output is correct
19 Correct 2 ms 848 KB Output is correct
20 Correct 2 ms 848 KB Output is correct
21 Correct 3 ms 848 KB Output is correct

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 8 ms 1248 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 732 KB Output is correct
3 Correct 2 ms 816 KB Output is correct
4 Correct 2 ms 816 KB Output is correct
5 Correct 2 ms 816 KB Output is correct
6 Correct 3 ms 816 KB Output is correct
7 Correct 2 ms 828 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 3 ms 828 KB Output is correct
10 Correct 2 ms 828 KB Output is correct
11 Correct 2 ms 844 KB Output is correct
12 Correct 2 ms 844 KB Output is correct
13 Correct 2 ms 848 KB Output is correct
14 Correct 2 ms 848 KB Output is correct
15 Correct 2 ms 848 KB Output is correct
16 Correct 2 ms 848 KB Output is correct
17 Correct 2 ms 848 KB Output is correct
18 Correct 2 ms 848 KB Output is correct
19 Correct 2 ms 848 KB Output is correct
20 Correct 2 ms 848 KB Output is correct
21 Correct 3 ms 848 KB Output is correct
22 Correct 3 ms 1304 KB Output is correct
23 Correct 5 ms 1304 KB Output is correct
24 Correct 5 ms 1304 KB Output is correct
25 Correct 3 ms 1304 KB Output is correct
26 Correct 6 ms 1304 KB Output is correct
27 Correct 7 ms 1368 KB Output is correct
28 Correct 3 ms 1368 KB Output is correct
29 Correct 3 ms 1368 KB Output is correct
30 Correct 4 ms 1368 KB Output is correct
31 Correct 3 ms 1368 KB Output is correct
32 Correct 4 ms 1368 KB Output is correct
33 Correct 3 ms 1368 KB Output is correct
34 Correct 3 ms 1444 KB Output is correct
35 Correct 3 ms 1444 KB Output is correct
36 Correct 3 ms 1444 KB Output is correct
37 Correct 3 ms 1444 KB Output is correct
38 Correct 3 ms 1444 KB Output is correct

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 2 ms 732 KB Output is correct
3 Correct 2 ms 816 KB Output is correct
4 Correct 2 ms 816 KB Output is correct
5 Correct 2 ms 816 KB Output is correct
6 Correct 3 ms 816 KB Output is correct
7 Correct 2 ms 828 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 3 ms 828 KB Output is correct
10 Correct 2 ms 828 KB Output is correct
11 Correct 2 ms 844 KB Output is correct
12 Correct 2 ms 844 KB Output is correct
13 Correct 2 ms 848 KB Output is correct
14 Correct 2 ms 848 KB Output is correct
15 Correct 2 ms 848 KB Output is correct
16 Correct 2 ms 848 KB Output is correct
17 Correct 2 ms 848 KB Output is correct
18 Correct 2 ms 848 KB Output is correct
19 Correct 2 ms 848 KB Output is correct
20 Correct 2 ms 848 KB Output is correct
21 Correct 3 ms 848 KB Output is correct
22 Runtime error 8 ms 1248 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Halted 0 ms 0 KB -