oj.uz

Submission #331878

# Submission time Handle Problem Language Result Execution time Memory
331878 2020-11-30T15:32:54 Z johutha Paprike (COI18_paprike) C++17
100 / 100
 77 ms 19584 KB 
#include <iostream>
#include <vector>
#include <algorithm>

#define int int64_t

using namespace std;

struct tree
{
    int k;
    vector<vector<int>> adjlist;
    vector<int> vs;

    int res = 0;
    
    int dfs(int curr, int par)
    {
        vector<int> poss;

        for (auto i : adjlist[curr])
        {
            if (par == i) continue;
            int cv = dfs(i, curr);
            poss.push_back(cv);
        }

        sort(poss.begin(), poss.end());
        int cnt = vs[curr];
        for (auto v : poss)
        {
            if (v + cnt <= k)
            {
                cnt += v;
            }
            else
            {
                res++;
            }
        }
        return cnt;
    }
};

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int n, k;
    cin >> n >> k;

    tree t;
    t.adjlist.resize(n);
    t.vs.resize(n);
    t.k = k;

    for (int i = 0; i < n; i++) cin >> t.vs[i];

    for (int i = 0; i<  n - 1; i++)
    {
        int a, b;
        cin >> a >> b;
        a--; b--;
        t.adjlist[a].push_back(b);
        t.adjlist[b].push_back(a);
    }

    t.dfs(0, -1);

    cout << t.res << "\n";
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 19564 KB Output is correct
2 Correct 54 ms 19564 KB Output is correct
3 Correct 53 ms 19564 KB Output is correct
4 Correct 66 ms 19584 KB Output is correct
5 Correct 51 ms 19436 KB Output is correct
6 Correct 60 ms 19564 KB Output is correct
7 Correct 59 ms 19564 KB Output is correct
8 Correct 54 ms 19064 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 268 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 476 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 52 ms 19564 KB Output is correct
23 Correct 54 ms 19564 KB Output is correct
24 Correct 53 ms 19564 KB Output is correct
25 Correct 66 ms 19584 KB Output is correct
26 Correct 51 ms 19436 KB Output is correct
27 Correct 60 ms 19564 KB Output is correct
28 Correct 59 ms 19564 KB Output is correct
29 Correct 54 ms 19064 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 492 KB Output is correct
47 Correct 56 ms 13036 KB Output is correct
48 Correct 53 ms 11244 KB Output is correct
49 Correct 51 ms 10624 KB Output is correct
50 Correct 62 ms 10220 KB Output is correct
51 Correct 74 ms 9196 KB Output is correct
52 Correct 73 ms 9196 KB Output is correct
53 Correct 67 ms 9068 KB Output is correct
54 Correct 73 ms 9196 KB Output is correct
55 Correct 77 ms 8684 KB Output is correct
56 Correct 75 ms 8684 KB Output is correct
57 Correct 40 ms 10592 KB Output is correct