oj.uz

Submission #240804

# Submission time Handle Problem Language Result Execution time Memory
240804 2020-06-21T08:18:17 Z ne4eHbKa Paprike (COI18_paprike) C++17
100 / 100
 81 ms 23928 KB 
//{ <defines>
#include <bits/stdc++.h>
using namespace std;

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")

#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)

#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _  << ' ' <<

#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back

#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;

inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());

template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}

int md = 998244353;

inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}

int m_bpow(ll A, ll b) {
    int a = A % md;
    ll ans = 1;
    for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
        (ans *= ans) %= md;
        if(p & b)
            (ans *= a) %= md;
    }
    re ans;
}

const ld pi = arg(complex<ld>(-1, 0));
const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 1e5 + 5;

int n, h[N], k;
vi g[N];

pii rec(int v = 0, int pr = -1) {
    int f = 0;
    ll s = 0;
    vector<int> t;
    t.reserve(sz(g[v]) + 1);
    for(int u : g[v]) {
        if(u == pr) continue;
        pii e = rec(u, v);
        f += e.ft;
        t.pb(e.sd);
    }
    sort(t.rbegin(), t.rend());
    t.pb(h[v]);
    for(int i : t) s += i;
    for(int i = 0; s > k; ++i) s -= t[i], ++f;
    return {f, s};
}

void solve() {
    cin >> n >> k;
    for(int i = 0; i < n; ++i) cin >> h[i], g[i].clear();
    for(int i = 1; i < n; ++i) {
        int x, y;
        cin >> x >> y;
        --x, --y;
        g[x].pb(y);
        g[y].pb(x);
    }
    cout << rec().ft << endl;
}

int main() {
    cout.precision(10); cout << fixed;
    cerr.precision(6); cerr << fixed;
#ifdef _LOCAL
    freopen("in.txt", "r", stdin);
    int tests; cin >> tests;
    for(int test = 1; test <= tests; ++test) {
		cerr << "case #" << test << endl;
        solve();
        cerr << endl;
    }
#else
//    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    solve();
#endif
    return 0;
}

Compilation message

paprike.cpp: In function 'int m_bpow(ll, ll)':
paprike.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
     for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
                       ~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 23928 KB Output is correct
2 Correct 67 ms 23800 KB Output is correct
3 Correct 67 ms 23800 KB Output is correct
4 Correct 69 ms 23928 KB Output is correct
5 Correct 66 ms 23800 KB Output is correct
6 Correct 69 ms 23928 KB Output is correct
7 Correct 67 ms 23800 KB Output is correct
8 Correct 63 ms 23288 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2688 KB Output is correct
2 Correct 6 ms 2688 KB Output is correct
3 Correct 6 ms 2688 KB Output is correct
4 Correct 6 ms 2688 KB Output is correct
5 Correct 6 ms 2688 KB Output is correct
6 Correct 6 ms 2688 KB Output is correct
7 Correct 6 ms 2688 KB Output is correct
8 Correct 7 ms 2688 KB Output is correct
9 Correct 6 ms 2688 KB Output is correct
10 Correct 6 ms 2688 KB Output is correct
11 Correct 7 ms 2688 KB Output is correct
12 Correct 6 ms 2688 KB Output is correct
13 Correct 6 ms 2692 KB Output is correct
14 Correct 6 ms 2688 KB Output is correct
15 Correct 7 ms 2688 KB Output is correct
16 Correct 7 ms 2688 KB Output is correct
17 Correct 6 ms 2688 KB Output is correct
18 Correct 6 ms 2688 KB Output is correct
19 Correct 6 ms 2688 KB Output is correct
20 Correct 6 ms 2688 KB Output is correct
21 Correct 6 ms 2688 KB Output is correct
22 Correct 67 ms 23928 KB Output is correct
23 Correct 67 ms 23800 KB Output is correct
24 Correct 67 ms 23800 KB Output is correct
25 Correct 69 ms 23928 KB Output is correct
26 Correct 66 ms 23800 KB Output is correct
27 Correct 69 ms 23928 KB Output is correct
28 Correct 67 ms 23800 KB Output is correct
29 Correct 63 ms 23288 KB Output is correct
30 Correct 7 ms 2816 KB Output is correct
31 Correct 7 ms 2816 KB Output is correct
32 Correct 7 ms 2816 KB Output is correct
33 Correct 6 ms 2816 KB Output is correct
34 Correct 6 ms 2816 KB Output is correct
35 Correct 6 ms 2688 KB Output is correct
36 Correct 6 ms 2688 KB Output is correct
37 Correct 6 ms 2688 KB Output is correct
38 Correct 7 ms 2816 KB Output is correct
39 Correct 6 ms 2688 KB Output is correct
40 Correct 7 ms 2816 KB Output is correct
41 Correct 7 ms 2688 KB Output is correct
42 Correct 6 ms 2688 KB Output is correct
43 Correct 6 ms 2688 KB Output is correct
44 Correct 6 ms 2688 KB Output is correct
45 Correct 6 ms 2688 KB Output is correct
46 Correct 6 ms 2688 KB Output is correct
47 Correct 70 ms 13432 KB Output is correct
48 Correct 67 ms 11128 KB Output is correct
49 Correct 72 ms 10232 KB Output is correct
50 Correct 74 ms 9720 KB Output is correct
51 Correct 66 ms 8312 KB Output is correct
52 Correct 71 ms 8324 KB Output is correct
53 Correct 81 ms 8184 KB Output is correct
54 Correct 79 ms 8292 KB Output is correct
55 Correct 65 ms 7800 KB Output is correct
56 Correct 61 ms 7672 KB Output is correct
57 Correct 51 ms 8688 KB Output is correct