#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;
#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 200005;
int n, k;
int niz[mxN];
vector<int> g[mxN];
int br = 0;
ll kol[mxN];
void dfs(int v, int p){
kol[v] = niz[v]; vector<ll> vec;
for(auto u : g[v]){
if(u != p){
dfs(u, v);
kol[v] += kol[u]; vec.pb(kol[u]);
}
}
sort(rall(vec));
for(auto c : vec){
if(kol[v] > k){
kol[v] -= c;
br += 1;
}
}
}
int main(){
cin.tie(0)->sync_with_stdio(0);
cin >> n >> k;
ff(i,1,n)cin >> niz[i];
ff(i,1,n - 1){
int u, v;
cin >> u >> v;
g[u].pb(v);
g[v].pb(u);
}
dfs(1, -1);
cout << br << '\n';
return 0;
}
/*
// probati bojenje sahovski
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4948 KB |
Output is correct |
2 |
Correct |
3 ms |
4948 KB |
Output is correct |
3 |
Correct |
2 ms |
5040 KB |
Output is correct |
4 |
Correct |
2 ms |
4948 KB |
Output is correct |
5 |
Correct |
2 ms |
4948 KB |
Output is correct |
6 |
Correct |
2 ms |
4948 KB |
Output is correct |
7 |
Correct |
2 ms |
4948 KB |
Output is correct |
8 |
Correct |
2 ms |
4948 KB |
Output is correct |
9 |
Correct |
3 ms |
4956 KB |
Output is correct |
10 |
Correct |
2 ms |
4948 KB |
Output is correct |
11 |
Correct |
2 ms |
5036 KB |
Output is correct |
12 |
Correct |
2 ms |
5036 KB |
Output is correct |
13 |
Correct |
2 ms |
5036 KB |
Output is correct |
14 |
Correct |
2 ms |
5036 KB |
Output is correct |
15 |
Correct |
3 ms |
4948 KB |
Output is correct |
16 |
Correct |
2 ms |
5032 KB |
Output is correct |
17 |
Correct |
2 ms |
5036 KB |
Output is correct |
18 |
Correct |
2 ms |
4948 KB |
Output is correct |
19 |
Correct |
2 ms |
4948 KB |
Output is correct |
20 |
Correct |
2 ms |
5036 KB |
Output is correct |
21 |
Correct |
4 ms |
4948 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
40 ms |
23776 KB |
Output is correct |
2 |
Correct |
44 ms |
23848 KB |
Output is correct |
3 |
Correct |
42 ms |
23796 KB |
Output is correct |
4 |
Correct |
46 ms |
23724 KB |
Output is correct |
5 |
Correct |
37 ms |
23724 KB |
Output is correct |
6 |
Correct |
37 ms |
23712 KB |
Output is correct |
7 |
Correct |
37 ms |
23696 KB |
Output is correct |
8 |
Correct |
36 ms |
23300 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4948 KB |
Output is correct |
2 |
Correct |
3 ms |
4948 KB |
Output is correct |
3 |
Correct |
2 ms |
5040 KB |
Output is correct |
4 |
Correct |
2 ms |
4948 KB |
Output is correct |
5 |
Correct |
2 ms |
4948 KB |
Output is correct |
6 |
Correct |
2 ms |
4948 KB |
Output is correct |
7 |
Correct |
2 ms |
4948 KB |
Output is correct |
8 |
Correct |
2 ms |
4948 KB |
Output is correct |
9 |
Correct |
3 ms |
4956 KB |
Output is correct |
10 |
Correct |
2 ms |
4948 KB |
Output is correct |
11 |
Correct |
2 ms |
5036 KB |
Output is correct |
12 |
Correct |
2 ms |
5036 KB |
Output is correct |
13 |
Correct |
2 ms |
5036 KB |
Output is correct |
14 |
Correct |
2 ms |
5036 KB |
Output is correct |
15 |
Correct |
3 ms |
4948 KB |
Output is correct |
16 |
Correct |
2 ms |
5032 KB |
Output is correct |
17 |
Correct |
2 ms |
5036 KB |
Output is correct |
18 |
Correct |
2 ms |
4948 KB |
Output is correct |
19 |
Correct |
2 ms |
4948 KB |
Output is correct |
20 |
Correct |
2 ms |
5036 KB |
Output is correct |
21 |
Correct |
4 ms |
4948 KB |
Output is correct |
22 |
Correct |
4 ms |
5044 KB |
Output is correct |
23 |
Correct |
3 ms |
5076 KB |
Output is correct |
24 |
Correct |
3 ms |
5076 KB |
Output is correct |
25 |
Correct |
3 ms |
5076 KB |
Output is correct |
26 |
Correct |
3 ms |
5076 KB |
Output is correct |
27 |
Correct |
2 ms |
5076 KB |
Output is correct |
28 |
Correct |
2 ms |
5076 KB |
Output is correct |
29 |
Correct |
2 ms |
5012 KB |
Output is correct |
30 |
Correct |
3 ms |
5076 KB |
Output is correct |
31 |
Correct |
2 ms |
5048 KB |
Output is correct |
32 |
Correct |
2 ms |
5076 KB |
Output is correct |
33 |
Correct |
3 ms |
5048 KB |
Output is correct |
34 |
Correct |
3 ms |
5076 KB |
Output is correct |
35 |
Correct |
3 ms |
5040 KB |
Output is correct |
36 |
Correct |
3 ms |
5040 KB |
Output is correct |
37 |
Correct |
4 ms |
5040 KB |
Output is correct |
38 |
Correct |
4 ms |
5048 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4948 KB |
Output is correct |
2 |
Correct |
3 ms |
4948 KB |
Output is correct |
3 |
Correct |
2 ms |
5040 KB |
Output is correct |
4 |
Correct |
2 ms |
4948 KB |
Output is correct |
5 |
Correct |
2 ms |
4948 KB |
Output is correct |
6 |
Correct |
2 ms |
4948 KB |
Output is correct |
7 |
Correct |
2 ms |
4948 KB |
Output is correct |
8 |
Correct |
2 ms |
4948 KB |
Output is correct |
9 |
Correct |
3 ms |
4956 KB |
Output is correct |
10 |
Correct |
2 ms |
4948 KB |
Output is correct |
11 |
Correct |
2 ms |
5036 KB |
Output is correct |
12 |
Correct |
2 ms |
5036 KB |
Output is correct |
13 |
Correct |
2 ms |
5036 KB |
Output is correct |
14 |
Correct |
2 ms |
5036 KB |
Output is correct |
15 |
Correct |
3 ms |
4948 KB |
Output is correct |
16 |
Correct |
2 ms |
5032 KB |
Output is correct |
17 |
Correct |
2 ms |
5036 KB |
Output is correct |
18 |
Correct |
2 ms |
4948 KB |
Output is correct |
19 |
Correct |
2 ms |
4948 KB |
Output is correct |
20 |
Correct |
2 ms |
5036 KB |
Output is correct |
21 |
Correct |
4 ms |
4948 KB |
Output is correct |
22 |
Correct |
40 ms |
23776 KB |
Output is correct |
23 |
Correct |
44 ms |
23848 KB |
Output is correct |
24 |
Correct |
42 ms |
23796 KB |
Output is correct |
25 |
Correct |
46 ms |
23724 KB |
Output is correct |
26 |
Correct |
37 ms |
23724 KB |
Output is correct |
27 |
Correct |
37 ms |
23712 KB |
Output is correct |
28 |
Correct |
37 ms |
23696 KB |
Output is correct |
29 |
Correct |
36 ms |
23300 KB |
Output is correct |
30 |
Correct |
4 ms |
5044 KB |
Output is correct |
31 |
Correct |
3 ms |
5076 KB |
Output is correct |
32 |
Correct |
3 ms |
5076 KB |
Output is correct |
33 |
Correct |
3 ms |
5076 KB |
Output is correct |
34 |
Correct |
3 ms |
5076 KB |
Output is correct |
35 |
Correct |
2 ms |
5076 KB |
Output is correct |
36 |
Correct |
2 ms |
5076 KB |
Output is correct |
37 |
Correct |
2 ms |
5012 KB |
Output is correct |
38 |
Correct |
3 ms |
5076 KB |
Output is correct |
39 |
Correct |
2 ms |
5048 KB |
Output is correct |
40 |
Correct |
2 ms |
5076 KB |
Output is correct |
41 |
Correct |
3 ms |
5048 KB |
Output is correct |
42 |
Correct |
3 ms |
5076 KB |
Output is correct |
43 |
Correct |
3 ms |
5040 KB |
Output is correct |
44 |
Correct |
3 ms |
5040 KB |
Output is correct |
45 |
Correct |
4 ms |
5040 KB |
Output is correct |
46 |
Correct |
4 ms |
5048 KB |
Output is correct |
47 |
Correct |
67 ms |
15776 KB |
Output is correct |
48 |
Correct |
34 ms |
13780 KB |
Output is correct |
49 |
Correct |
36 ms |
13004 KB |
Output is correct |
50 |
Correct |
34 ms |
12620 KB |
Output is correct |
51 |
Correct |
44 ms |
11400 KB |
Output is correct |
52 |
Correct |
37 ms |
11408 KB |
Output is correct |
53 |
Correct |
37 ms |
11324 KB |
Output is correct |
54 |
Correct |
38 ms |
11248 KB |
Output is correct |
55 |
Correct |
33 ms |
10756 KB |
Output is correct |
56 |
Correct |
33 ms |
10792 KB |
Output is correct |
57 |
Correct |
26 ms |
12304 KB |
Output is correct |