oj.uz

Submission #240754

# Submission time Handle Problem Language Result Execution time Memory
240754 2020-06-21T06:44:21 Z kartel Paprike (COI18_paprike) C++14
100 / 100
 79 ms 20728 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +200500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x.begin(), x.end())
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

vector <int> g[N];
ll f[N], cost[N], k;
int i, n, u, v, ans;

bool cmp(int u, int v)
{
    return f[u] < f[v];
}

void dfs(int v, int pr)
{
    vector <int> vec;
    f[v] = cost[v];

    for (auto u : g[v])
    {
        if (u == pr) continue;

        dfs(u, v);

        f[v] += f[u];

        vec.pb(u);
    }

    if (f[v] > k)
    {
        sort(vec.begin(), vec.end(), cmp);

//        cerr << el;
//        for (auto x : vec) cerr << x << " " << f[x] << el;

        while (f[v] > k)
        {
//            cerr << v << " " << vec.back() << el;
            f[v] -= f[vec.back()];
            vec.pop_back();
            ans++;
        }
    }
//    cerr << v << " " << f[v] << el;
//    cerr << el;
}

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> k;

    for (i = 1; i <= n; i++) cin >> cost[i];

    for (i = 1; i < n; i++)
    {
        cin >> u >> v;

        g[u].pb(v);
        g[v].pb(u);
    }

    dfs(1, -1);

    cout << ans;
}

//
//00000
//00110
//00111
//00011
//00000

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 20728 KB Output is correct
2 Correct 64 ms 20728 KB Output is correct
3 Correct 62 ms 20728 KB Output is correct
4 Correct 66 ms 20728 KB Output is correct
5 Correct 65 ms 20728 KB Output is correct
6 Correct 64 ms 20728 KB Output is correct
7 Correct 60 ms 20728 KB Output is correct
8 Correct 59 ms 20728 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4992 KB Output is correct
2 Correct 8 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 7 ms 4992 KB Output is correct
5 Correct 7 ms 4992 KB Output is correct
6 Correct 7 ms 4992 KB Output is correct
7 Correct 8 ms 4992 KB Output is correct
8 Correct 7 ms 4992 KB Output is correct
9 Correct 7 ms 4992 KB Output is correct
10 Correct 7 ms 5120 KB Output is correct
11 Correct 7 ms 5024 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 7 ms 4992 KB Output is correct
14 Correct 7 ms 4992 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 4992 KB Output is correct
17 Correct 7 ms 5120 KB Output is correct
18 Correct 7 ms 5120 KB Output is correct
19 Correct 8 ms 4992 KB Output is correct
20 Correct 7 ms 4992 KB Output is correct
21 Correct 7 ms 4992 KB Output is correct
22 Correct 63 ms 20728 KB Output is correct
23 Correct 64 ms 20728 KB Output is correct
24 Correct 62 ms 20728 KB Output is correct
25 Correct 66 ms 20728 KB Output is correct
26 Correct 65 ms 20728 KB Output is correct
27 Correct 64 ms 20728 KB Output is correct
28 Correct 60 ms 20728 KB Output is correct
29 Correct 59 ms 20728 KB Output is correct
30 Correct 7 ms 5120 KB Output is correct
31 Correct 8 ms 5120 KB Output is correct
32 Correct 7 ms 5120 KB Output is correct
33 Correct 7 ms 5120 KB Output is correct
34 Correct 7 ms 5120 KB Output is correct
35 Correct 8 ms 5120 KB Output is correct
36 Correct 8 ms 5120 KB Output is correct
37 Correct 8 ms 5120 KB Output is correct
38 Correct 7 ms 5120 KB Output is correct
39 Correct 7 ms 5120 KB Output is correct
40 Correct 7 ms 5120 KB Output is correct
41 Correct 8 ms 5120 KB Output is correct
42 Correct 7 ms 5120 KB Output is correct
43 Correct 8 ms 5120 KB Output is correct
44 Correct 7 ms 5120 KB Output is correct
45 Correct 8 ms 5120 KB Output is correct
46 Correct 7 ms 5120 KB Output is correct
47 Correct 65 ms 13740 KB Output is correct
48 Correct 63 ms 12024 KB Output is correct
49 Correct 64 ms 11256 KB Output is correct
50 Correct 67 ms 10872 KB Output is correct
51 Correct 75 ms 9848 KB Output is correct
52 Correct 79 ms 9848 KB Output is correct
53 Correct 78 ms 9848 KB Output is correct
54 Correct 69 ms 9848 KB Output is correct
55 Correct 63 ms 9800 KB Output is correct
56 Correct 63 ms 9848 KB Output is correct
57 Correct 45 ms 10608 KB Output is correct