Submission #57738

# Submission time Handle Problem Language Result Execution time Memory
57738 2018-07-16T00:57:13 Z Benq Paprike (COI18_paprike) C++14
100 / 100
170 ms 43648 KB
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int n,k,h[MX];
vi adj[MX];

pi dfs(int x, int y = 0) {
	pi ret = {h[x],0};
	vi v;
	for (int i: adj[x]) if (i != y) {
		pi a = dfs(i,x);
		ret.s += a.s;
		v.pb(a.f);
	}
	sort(all(v)); reverse(all(v));
	while (sz(v) && ret.f+v.back() <= k) {
		ret.f += v.back(); v.pop_back();
	}
	ret.s += sz(v);
	return ret;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n >> k;
	FOR(i,1,n+1) cin >> h[i];
	F0R(i,n-1) {
		int a,b; cin >> a >> b;
		adj[a].pb(b), adj[b].pb(a);
	}
	pi x = dfs(1);
	if (x.f) x.s ++;
	cout << x.s-1;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2844 KB Output is correct
3 Correct 4 ms 2844 KB Output is correct
4 Correct 4 ms 2844 KB Output is correct
5 Correct 7 ms 2844 KB Output is correct
6 Correct 4 ms 2844 KB Output is correct
7 Correct 4 ms 2844 KB Output is correct
8 Correct 3 ms 2844 KB Output is correct
9 Correct 4 ms 2844 KB Output is correct
10 Correct 4 ms 2928 KB Output is correct
11 Correct 4 ms 3024 KB Output is correct
12 Correct 4 ms 3024 KB Output is correct
13 Correct 6 ms 3024 KB Output is correct
14 Correct 4 ms 3088 KB Output is correct
15 Correct 4 ms 3088 KB Output is correct
16 Correct 4 ms 3088 KB Output is correct
17 Correct 4 ms 3088 KB Output is correct
18 Correct 4 ms 3088 KB Output is correct
19 Correct 4 ms 3164 KB Output is correct
20 Correct 4 ms 3164 KB Output is correct
21 Correct 6 ms 3164 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 116 ms 19712 KB Output is correct
2 Correct 109 ms 21664 KB Output is correct
3 Correct 114 ms 23624 KB Output is correct
4 Correct 101 ms 25656 KB Output is correct
5 Correct 94 ms 27524 KB Output is correct
6 Correct 105 ms 29532 KB Output is correct
7 Correct 103 ms 31500 KB Output is correct
8 Correct 88 ms 32864 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2844 KB Output is correct
3 Correct 4 ms 2844 KB Output is correct
4 Correct 4 ms 2844 KB Output is correct
5 Correct 7 ms 2844 KB Output is correct
6 Correct 4 ms 2844 KB Output is correct
7 Correct 4 ms 2844 KB Output is correct
8 Correct 3 ms 2844 KB Output is correct
9 Correct 4 ms 2844 KB Output is correct
10 Correct 4 ms 2928 KB Output is correct
11 Correct 4 ms 3024 KB Output is correct
12 Correct 4 ms 3024 KB Output is correct
13 Correct 6 ms 3024 KB Output is correct
14 Correct 4 ms 3088 KB Output is correct
15 Correct 4 ms 3088 KB Output is correct
16 Correct 4 ms 3088 KB Output is correct
17 Correct 4 ms 3088 KB Output is correct
18 Correct 4 ms 3088 KB Output is correct
19 Correct 4 ms 3164 KB Output is correct
20 Correct 4 ms 3164 KB Output is correct
21 Correct 6 ms 3164 KB Output is correct
22 Correct 7 ms 32864 KB Output is correct
23 Correct 8 ms 32864 KB Output is correct
24 Correct 7 ms 32864 KB Output is correct
25 Correct 7 ms 32864 KB Output is correct
26 Correct 7 ms 32864 KB Output is correct
27 Correct 6 ms 32864 KB Output is correct
28 Correct 6 ms 32864 KB Output is correct
29 Correct 8 ms 32864 KB Output is correct
30 Correct 4 ms 32864 KB Output is correct
31 Correct 7 ms 32864 KB Output is correct
32 Correct 5 ms 32864 KB Output is correct
33 Correct 6 ms 32864 KB Output is correct
34 Correct 7 ms 32864 KB Output is correct
35 Correct 6 ms 32864 KB Output is correct
36 Correct 7 ms 32864 KB Output is correct
37 Correct 6 ms 32864 KB Output is correct
38 Correct 6 ms 32864 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2844 KB Output is correct
3 Correct 4 ms 2844 KB Output is correct
4 Correct 4 ms 2844 KB Output is correct
5 Correct 7 ms 2844 KB Output is correct
6 Correct 4 ms 2844 KB Output is correct
7 Correct 4 ms 2844 KB Output is correct
8 Correct 3 ms 2844 KB Output is correct
9 Correct 4 ms 2844 KB Output is correct
10 Correct 4 ms 2928 KB Output is correct
11 Correct 4 ms 3024 KB Output is correct
12 Correct 4 ms 3024 KB Output is correct
13 Correct 6 ms 3024 KB Output is correct
14 Correct 4 ms 3088 KB Output is correct
15 Correct 4 ms 3088 KB Output is correct
16 Correct 4 ms 3088 KB Output is correct
17 Correct 4 ms 3088 KB Output is correct
18 Correct 4 ms 3088 KB Output is correct
19 Correct 4 ms 3164 KB Output is correct
20 Correct 4 ms 3164 KB Output is correct
21 Correct 6 ms 3164 KB Output is correct
22 Correct 116 ms 19712 KB Output is correct
23 Correct 109 ms 21664 KB Output is correct
24 Correct 114 ms 23624 KB Output is correct
25 Correct 101 ms 25656 KB Output is correct
26 Correct 94 ms 27524 KB Output is correct
27 Correct 105 ms 29532 KB Output is correct
28 Correct 103 ms 31500 KB Output is correct
29 Correct 88 ms 32864 KB Output is correct
30 Correct 7 ms 32864 KB Output is correct
31 Correct 8 ms 32864 KB Output is correct
32 Correct 7 ms 32864 KB Output is correct
33 Correct 7 ms 32864 KB Output is correct
34 Correct 7 ms 32864 KB Output is correct
35 Correct 6 ms 32864 KB Output is correct
36 Correct 6 ms 32864 KB Output is correct
37 Correct 8 ms 32864 KB Output is correct
38 Correct 4 ms 32864 KB Output is correct
39 Correct 7 ms 32864 KB Output is correct
40 Correct 5 ms 32864 KB Output is correct
41 Correct 6 ms 32864 KB Output is correct
42 Correct 7 ms 32864 KB Output is correct
43 Correct 6 ms 32864 KB Output is correct
44 Correct 7 ms 32864 KB Output is correct
45 Correct 6 ms 32864 KB Output is correct
46 Correct 6 ms 32864 KB Output is correct
47 Correct 119 ms 32864 KB Output is correct
48 Correct 95 ms 32864 KB Output is correct
49 Correct 127 ms 32864 KB Output is correct
50 Correct 96 ms 32864 KB Output is correct
51 Correct 142 ms 32864 KB Output is correct
52 Correct 152 ms 34276 KB Output is correct
53 Correct 170 ms 36124 KB Output is correct
54 Correct 151 ms 38120 KB Output is correct
55 Correct 128 ms 39420 KB Output is correct
56 Correct 153 ms 40964 KB Output is correct
57 Correct 91 ms 43648 KB Output is correct