oj.uz

Submission #144544

# Submission time Handle Problem Language Result Execution time Memory
144544 2019-08-17T06:20:03 Z SamAnd Paprike (COI18_paprike) C++17
100 / 100
 89 ms 16120 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;

int n, k;
int b[N];
vector<int> a[N];

int yans;
int ans[N];
void dfs(int x, int p)
{
    vector<int> v;
    for (int i = 0; i < a[x].size(); ++i)
    {
        int h = a[x][i];
        if (h == p)
            continue;
        dfs(h, x);
        v.push_back(ans[h]);
    }
    ans[x] = b[x];
    sort(v.begin(), v.end());
    for (int i = 0; i < v.size(); ++i)
    {
        if (ans[x] + v[i] <= k)
            ans[x] += v[i];
        else
        {
            yans += (v.size() - i);
            break;
        }
    }
}

int main()
{
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; ++i)
        scanf("%d", &b[i]);
    for (int i = 0; i < n - 1; ++i)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        a[x].push_back(y);
        a[y].push_back(x);
    }
    dfs(1, 1);
    cout << yans << endl;
    return 0;
}

Compilation message

paprike.cpp: In function 'void dfs(int, int)':
paprike.cpp:14:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < a[x].size(); ++i)
                     ~~^~~~~~~~~~~~~
paprike.cpp:24:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v.size(); ++i)
                     ~~^~~~~~~~~~
paprike.cpp: In function 'int main()':
paprike.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~
paprike.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &b[i]);
         ~~~~~^~~~~~~~~~~~~
paprike.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &x, &y);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 15992 KB Output is correct
2 Correct 70 ms 16120 KB Output is correct
3 Correct 70 ms 15996 KB Output is correct
4 Correct 71 ms 15976 KB Output is correct
5 Correct 69 ms 15992 KB Output is correct
6 Correct 69 ms 16016 KB Output is correct
7 Correct 69 ms 15996 KB Output is correct
8 Correct 64 ms 16120 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 5 ms 2680 KB Output is correct
15 Correct 5 ms 2680 KB Output is correct
16 Correct 5 ms 2680 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 4 ms 2680 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 4 ms 2680 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct
22 Correct 5 ms 2808 KB Output is correct
23 Correct 5 ms 2808 KB Output is correct
24 Correct 5 ms 2680 KB Output is correct
25 Correct 4 ms 2680 KB Output is correct
26 Correct 5 ms 2684 KB Output is correct
27 Correct 5 ms 2680 KB Output is correct
28 Correct 5 ms 2680 KB Output is correct
29 Correct 5 ms 2680 KB Output is correct
30 Correct 5 ms 2680 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 5 ms 2680 KB Output is correct
33 Correct 5 ms 2680 KB Output is correct
34 Correct 5 ms 2680 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct
36 Correct 5 ms 2680 KB Output is correct
37 Correct 4 ms 2680 KB Output is correct
38 Correct 4 ms 2680 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2680 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 5 ms 2680 KB Output is correct
15 Correct 5 ms 2680 KB Output is correct
16 Correct 5 ms 2680 KB Output is correct
17 Correct 4 ms 2680 KB Output is correct
18 Correct 4 ms 2680 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 4 ms 2680 KB Output is correct
21 Correct 4 ms 2680 KB Output is correct
22 Correct 70 ms 15992 KB Output is correct
23 Correct 70 ms 16120 KB Output is correct
24 Correct 70 ms 15996 KB Output is correct
25 Correct 71 ms 15976 KB Output is correct
26 Correct 69 ms 15992 KB Output is correct
27 Correct 69 ms 16016 KB Output is correct
28 Correct 69 ms 15996 KB Output is correct
29 Correct 64 ms 16120 KB Output is correct
30 Correct 5 ms 2808 KB Output is correct
31 Correct 5 ms 2808 KB Output is correct
32 Correct 5 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 5 ms 2684 KB Output is correct
35 Correct 5 ms 2680 KB Output is correct
36 Correct 5 ms 2680 KB Output is correct
37 Correct 5 ms 2680 KB Output is correct
38 Correct 5 ms 2680 KB Output is correct
39 Correct 4 ms 2680 KB Output is correct
40 Correct 5 ms 2680 KB Output is correct
41 Correct 5 ms 2680 KB Output is correct
42 Correct 5 ms 2680 KB Output is correct
43 Correct 4 ms 2680 KB Output is correct
44 Correct 5 ms 2680 KB Output is correct
45 Correct 4 ms 2680 KB Output is correct
46 Correct 4 ms 2680 KB Output is correct
47 Correct 68 ms 10084 KB Output is correct
48 Correct 67 ms 8536 KB Output is correct
49 Correct 67 ms 7928 KB Output is correct
50 Correct 67 ms 7644 KB Output is correct
51 Correct 85 ms 6652 KB Output is correct
52 Correct 87 ms 6648 KB Output is correct
53 Correct 89 ms 6648 KB Output is correct
54 Correct 88 ms 6728 KB Output is correct
55 Correct 85 ms 6776 KB Output is correct
56 Correct 87 ms 6648 KB Output is correct
57 Correct 47 ms 7536 KB Output is correct