oj.uz

Submission #939259

# Submission time Handle Problem Language Result Execution time Memory
939259 2024-03-06T07:39:16 Z Whisper Paprike (COI18_paprike) C++17
100 / 100
 43 ms 22116 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 1e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numNode, Lim;
int C[MAX];
vector<int> G[MAX];
int dp[MAX];
int ans = 0;
void dfs(int u, int p){
    dp[u] = C[u];
    vector<int> store;
    for (int &v : G[u]) if(v ^ p){
        dfs(v, u);
        dp[u] += dp[v];
        store.push_back(dp[v]);
    }
    sort(store.rbegin(), store.rend());
    for (int&v : store){
        if(dp[u] <= Lim) break;
        dp[u] -= v; ++ans;
    }
}
void Whisper(){
    cin >> numNode >> Lim;
    for (int i = 1; i <= numNode; ++i) cin >> C[i];
    for (int i = 1; i < numNode; ++i){
        int u, v; cin >> u >> v;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }
    dfs(1, 0);
    cout << ans;
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 19852 KB Output is correct
2 Correct 43 ms 22116 KB Output is correct
3 Correct 39 ms 21840 KB Output is correct
4 Correct 39 ms 21840 KB Output is correct
5 Correct 37 ms 21840 KB Output is correct
6 Correct 40 ms 21840 KB Output is correct
7 Correct 37 ms 21840 KB Output is correct
8 Correct 35 ms 21328 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 3420 KB Output is correct
2 Correct 1 ms 3424 KB Output is correct
3 Correct 1 ms 3420 KB Output is correct
4 Correct 1 ms 3420 KB Output is correct
5 Correct 1 ms 3420 KB Output is correct
6 Correct 1 ms 3420 KB Output is correct
7 Correct 1 ms 3420 KB Output is correct
8 Correct 1 ms 3420 KB Output is correct
9 Correct 1 ms 3420 KB Output is correct
10 Correct 1 ms 3420 KB Output is correct
11 Correct 1 ms 3420 KB Output is correct
12 Correct 2 ms 3420 KB Output is correct
13 Correct 1 ms 3420 KB Output is correct
14 Correct 1 ms 3424 KB Output is correct
15 Correct 1 ms 3420 KB Output is correct
16 Correct 1 ms 3420 KB Output is correct
17 Correct 1 ms 3416 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 1 ms 3420 KB Output is correct
20 Correct 1 ms 3420 KB Output is correct
21 Correct 1 ms 3416 KB Output is correct
22 Correct 39 ms 19852 KB Output is correct
23 Correct 43 ms 22116 KB Output is correct
24 Correct 39 ms 21840 KB Output is correct
25 Correct 39 ms 21840 KB Output is correct
26 Correct 37 ms 21840 KB Output is correct
27 Correct 40 ms 21840 KB Output is correct
28 Correct 37 ms 21840 KB Output is correct
29 Correct 35 ms 21328 KB Output is correct
30 Correct 1 ms 3416 KB Output is correct
31 Correct 2 ms 3420 KB Output is correct
32 Correct 2 ms 3432 KB Output is correct
33 Correct 1 ms 3416 KB Output is correct
34 Correct 0 ms 3492 KB Output is correct
35 Correct 1 ms 3416 KB Output is correct
36 Correct 2 ms 3672 KB Output is correct
37 Correct 2 ms 3420 KB Output is correct
38 Correct 1 ms 3420 KB Output is correct
39 Correct 1 ms 3420 KB Output is correct
40 Correct 2 ms 3420 KB Output is correct
41 Correct 2 ms 3420 KB Output is correct
42 Correct 1 ms 3420 KB Output is correct
43 Correct 1 ms 3672 KB Output is correct
44 Correct 1 ms 3420 KB Output is correct
45 Correct 1 ms 3420 KB Output is correct
46 Correct 1 ms 3420 KB Output is correct
47 Correct 43 ms 14324 KB Output is correct
48 Correct 35 ms 12236 KB Output is correct
49 Correct 33 ms 11612 KB Output is correct
50 Correct 33 ms 11036 KB Output is correct
51 Correct 36 ms 9808 KB Output is correct
52 Correct 35 ms 10076 KB Output is correct
53 Correct 34 ms 9820 KB Output is correct
54 Correct 40 ms 10064 KB Output is correct
55 Correct 32 ms 9304 KB Output is correct
56 Correct 32 ms 9304 KB Output is correct
57 Correct 24 ms 11464 KB Output is correct