oj.uz

Submission #318466

# Submission time Handle Problem Language Result Execution time Memory
318466 2020-11-02T02:36:39 Z penguin71630 Paprike (COI18_paprike) C++14
100 / 100
 71 ms 15972 KB 
#include <bits/stdc++.h>

#define Optimize ios_base::sync_with_stdio(false); cin.tie(0);
#define F first
#define S second
#define mp(a, b) make_pair(a, b)
#define iter(a) a.begin(), a.end()
#define ariter(_a, _n) _a, _a+_n
#define dbg(a, b) cout << "var " << a << " -> " << b << '\n';
#define dbg_itv(l, r, val) cout << "### (" << l << ", " << r << ") -> " << val << '\n';
#define flag(_a) cout << "Still alive at flag " << _a << '\n';
#define printv(_a) for (auto& _i : _a) cout << _i << ' '; cout << '\n';
#define printchar(_c, _n) for (int i = 0; i < _n; i++) cout << _c;
#define clear_stk(_s) while (!_s.empty()) _s.pop();
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 1e5 + 1;
const int lgmx = 17;
const int INF = 2147483647;
const ll LLINF = 1e18;
const int MOD = 1e9 + 7;

int n, ans = 0;
ll k;
vector<int> G[maxn];
vector<ll> val;

ll dfs(int u, int pa) {
    ll sz = val[u];
    priority_queue<int> kids;
    for (auto& i : G[u]) {
        if (i == pa) continue;
        ll kid = dfs(i, u);
        sz += kid;
        kids.push(kid);
    }
    while (!kids.empty() && sz > k) {
        sz -= kids.top();
        ans++;
        kids.pop();
    }
    return sz;
}

int main() {
    Optimize

    cin >> n >> k;
    val.resize(n);
    fill(ariter(G, maxn), vector<int>());

    for (auto& i : val) cin >> i;
    for (int i = 0; i < n-1; i++) {
        int u, v; cin >> u >> v;
        u--; v--;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }

    dfs(0, -1);
    cout << ans << '\n';

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 15972 KB Output is correct
2 Correct 51 ms 15972 KB Output is correct
3 Correct 50 ms 15972 KB Output is correct
4 Correct 49 ms 15972 KB Output is correct
5 Correct 49 ms 15972 KB Output is correct
6 Correct 49 ms 15972 KB Output is correct
7 Correct 49 ms 15972 KB Output is correct
8 Correct 48 ms 15968 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2688 KB Output is correct
2 Correct 3 ms 2796 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 3 ms 2796 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 3 ms 2668 KB Output is correct
12 Correct 3 ms 2668 KB Output is correct
13 Correct 3 ms 2668 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 2 ms 2668 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2668 KB Output is correct
19 Correct 2 ms 2668 KB Output is correct
20 Correct 2 ms 2668 KB Output is correct
21 Correct 2 ms 2668 KB Output is correct
22 Correct 49 ms 15972 KB Output is correct
23 Correct 51 ms 15972 KB Output is correct
24 Correct 50 ms 15972 KB Output is correct
25 Correct 49 ms 15972 KB Output is correct
26 Correct 49 ms 15972 KB Output is correct
27 Correct 49 ms 15972 KB Output is correct
28 Correct 49 ms 15972 KB Output is correct
29 Correct 48 ms 15968 KB Output is correct
30 Correct 4 ms 2796 KB Output is correct
31 Correct 3 ms 2796 KB Output is correct
32 Correct 3 ms 2796 KB Output is correct
33 Correct 3 ms 2668 KB Output is correct
34 Correct 3 ms 2796 KB Output is correct
35 Correct 3 ms 2668 KB Output is correct
36 Correct 3 ms 2668 KB Output is correct
37 Correct 3 ms 2668 KB Output is correct
38 Correct 3 ms 2668 KB Output is correct
39 Correct 3 ms 2668 KB Output is correct
40 Correct 3 ms 2668 KB Output is correct
41 Correct 3 ms 2668 KB Output is correct
42 Correct 3 ms 2668 KB Output is correct
43 Correct 3 ms 2668 KB Output is correct
44 Correct 4 ms 2796 KB Output is correct
45 Correct 3 ms 2668 KB Output is correct
46 Correct 3 ms 2796 KB Output is correct
47 Correct 50 ms 10084 KB Output is correct
48 Correct 52 ms 8560 KB Output is correct
49 Correct 53 ms 7908 KB Output is correct
50 Correct 50 ms 7800 KB Output is correct
51 Correct 65 ms 6756 KB Output is correct
52 Correct 71 ms 6756 KB Output is correct
53 Correct 67 ms 6756 KB Output is correct
54 Correct 63 ms 6756 KB Output is correct
55 Correct 60 ms 6756 KB Output is correct
56 Correct 62 ms 6756 KB Output is correct
57 Correct 39 ms 7780 KB Output is correct