oj.uz

Submission #72965

# Submission time Handle Problem Language Result Execution time Memory
72965 2018-08-27T10:20:54 Z badrovinho Paprike (COI18_paprike) C++14
11 / 100
 13 ms 2236 KB 
#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

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.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 628 KB Output is correct
2 Correct 3 ms 628 KB Output is correct
3 Correct 3 ms 736 KB Output is correct
4 Correct 2 ms 756 KB Output is correct
5 Correct 2 ms 808 KB Output is correct
6 Correct 3 ms 808 KB Output is correct
7 Correct 2 ms 808 KB Output is correct
8 Correct 3 ms 980 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 3 ms 980 KB Output is correct
14 Correct 3 ms 980 KB Output is correct
15 Correct 3 ms 980 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 3 ms 1096 KB Output is correct
18 Correct 3 ms 1096 KB Output is correct
19 Correct 2 ms 1096 KB Output is correct
20 Correct 3 ms 1096 KB Output is correct
21 Correct 3 ms 1180 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 1880 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 628 KB Output is correct
2 Correct 3 ms 628 KB Output is correct
3 Correct 3 ms 736 KB Output is correct
4 Correct 2 ms 756 KB Output is correct
5 Correct 2 ms 808 KB Output is correct
6 Correct 3 ms 808 KB Output is correct
7 Correct 2 ms 808 KB Output is correct
8 Correct 3 ms 980 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 3 ms 980 KB Output is correct
14 Correct 3 ms 980 KB Output is correct
15 Correct 3 ms 980 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 3 ms 1096 KB Output is correct
18 Correct 3 ms 1096 KB Output is correct
19 Correct 2 ms 1096 KB Output is correct
20 Correct 3 ms 1096 KB Output is correct
21 Correct 3 ms 1180 KB Output is correct
22 Correct 5 ms 2004 KB Output is correct
23 Correct 4 ms 2004 KB Output is correct
24 Correct 4 ms 2004 KB Output is correct
25 Correct 5 ms 2004 KB Output is correct
26 Correct 5 ms 2004 KB Output is correct
27 Correct 6 ms 2024 KB Output is correct
28 Correct 5 ms 2040 KB Output is correct
29 Correct 5 ms 2056 KB Output is correct
30 Correct 5 ms 2072 KB Output is correct
31 Correct 5 ms 2216 KB Output is correct
32 Correct 3 ms 2216 KB Output is correct
33 Correct 4 ms 2216 KB Output is correct
34 Correct 3 ms 2216 KB Output is correct
35 Correct 4 ms 2216 KB Output is correct
36 Correct 3 ms 2216 KB Output is correct
37 Correct 4 ms 2236 KB Output is correct
38 Incorrect 4 ms 2236 KB Output isn't correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 628 KB Output is correct
2 Correct 3 ms 628 KB Output is correct
3 Correct 3 ms 736 KB Output is correct
4 Correct 2 ms 756 KB Output is correct
5 Correct 2 ms 808 KB Output is correct
6 Correct 3 ms 808 KB Output is correct
7 Correct 2 ms 808 KB Output is correct
8 Correct 3 ms 980 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 3 ms 980 KB Output is correct
14 Correct 3 ms 980 KB Output is correct
15 Correct 3 ms 980 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 3 ms 1096 KB Output is correct
18 Correct 3 ms 1096 KB Output is correct
19 Correct 2 ms 1096 KB Output is correct
20 Correct 3 ms 1096 KB Output is correct
21 Correct 3 ms 1180 KB Output is correct
22 Runtime error 13 ms 1880 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Halted 0 ms 0 KB -