oj.uz

Submission #640586

# Submission time Handle Problem Language Result Execution time Memory
640586 2022-09-15T01:58:24 Z CDuong Paprike (COI18_paprike) C++17
100 / 100
 54 ms 18324 KB 
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#define taskname "bai3"
#define int long long
#define ull unsigned long long
#define float long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
#define pii pair<int, int>
using namespace std;
const int mxN = 1e5 + 5;
const int mod = 1e9 + 7;
const int oo = 0x3f3f3f3f;
int n, k, val[mxN], sus[mxN];
vector<int> G[mxN];
int ans;
int sum(int u, int par){
    int res = val[u];
    for(auto tmp : G[u]){
        //cout << u << " " << tmp << endl;
        if(tmp == par) continue;
        res += sum(tmp, u);
    }
    if(res > k){
        vector<int> v;
        for(auto tmp : G[u]){
            if(tmp == par) continue;
            v.pb(sus[tmp]);
        }
        //cout << v.size() << endl;
        sort(v.begin(), v.end());
        int sums = val[u];
        for(int i = 0; i < (int)v.size(); ++i){
            if(sums + v[i] <= k) sums += v[i];
            else{
                ans += v.size() - i;
                sus[u] = sums;
                return sus[u];
            }
        }
    }
    //cout << u << " " << res << endl;
    sus[u] = res;
    return res;
}
void solve(){
    cin >> n >> k;
    for(int i = 1; i <= n; ++i){
        cin >> val[i];
    }
    for(int i = 1; i < n; ++i){
        int x, y; cin >> x >> y;
        //cout << x << " " << y << endl;
        G[x].pb(y);
        G[y].pb(x);
    }
    sum(1, -1);
    cout << ans << endl;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //freopen(taskname".inp", "r", stdin);
    //freopen(taskname".out", "w", stdout);
    int t = 1; //cin >> t;
    while(t--) solve();
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 18184 KB Output is correct
2 Correct 38 ms 18300 KB Output is correct
3 Correct 39 ms 18324 KB Output is correct
4 Correct 41 ms 18252 KB Output is correct
5 Correct 40 ms 18240 KB Output is correct
6 Correct 35 ms 18260 KB Output is correct
7 Correct 35 ms 18280 KB Output is correct
8 Correct 33 ms 18200 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 1 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 1 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 1 ms 2644 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 1 ms 2644 KB Output is correct
22 Correct 41 ms 18184 KB Output is correct
23 Correct 38 ms 18300 KB Output is correct
24 Correct 39 ms 18324 KB Output is correct
25 Correct 41 ms 18252 KB Output is correct
26 Correct 40 ms 18240 KB Output is correct
27 Correct 35 ms 18260 KB Output is correct
28 Correct 35 ms 18280 KB Output is correct
29 Correct 33 ms 18200 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 1 ms 2644 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2644 KB Output is correct
47 Correct 41 ms 11352 KB Output is correct
48 Correct 37 ms 9812 KB Output is correct
49 Correct 37 ms 9164 KB Output is correct
50 Correct 38 ms 8816 KB Output is correct
51 Correct 45 ms 7900 KB Output is correct
52 Correct 47 ms 7892 KB Output is correct
53 Correct 43 ms 7964 KB Output is correct
54 Correct 48 ms 7856 KB Output is correct
55 Correct 43 ms 7900 KB Output is correct
56 Correct 54 ms 7856 KB Output is correct
57 Correct 27 ms 9656 KB Output is correct