#include <bits/stdc++.h>
using namespace std;
#define lesgooo ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl '\n'
#define int long long
vector<int> par, sum, sz;
int n, x, y, k;
int find(int u) {return par[u] = (u == par[u]? u : find(par[u]));}
int unionn(int u, int v)
{
u = find(u), v = find(v);
if (sum[u]+sum[v] > k) return 1;
if (sz[u] < sz[v]) swap(u, v);
sz[u]+=sz[v], par[v] = u, sum[u]+=sum[v];
return 0;
}
signed main()
{
lesgooo;
cin >> n >> k;
par.resize(n), sum.resize(n), sz.resize(n);
for (int i =0 ; i < n; i++) cin >> sum[i], par[i] = i, sz[i] = 1;
int ans =0 ;
vector<vector<int>> edges;
for (int i = 0; i < n-1; i++) cin >> x >> y, edges.push_back({--x, --y, sum[x]+sum[y]});
// sort(edges.begin(), edges.end(), [&](auto _a, auto _b) {return _a[2] < _b[2];});
for (int i = 0; i < n-1; i++) ans+=unionn(edges[i][0], edges[i][1]);
cout << ans;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
29 ms |
8104 KB |
Output is correct |
2 |
Correct |
32 ms |
10128 KB |
Output is correct |
3 |
Correct |
34 ms |
10092 KB |
Output is correct |
4 |
Correct |
36 ms |
10128 KB |
Output is correct |
5 |
Correct |
36 ms |
10004 KB |
Output is correct |
6 |
Correct |
34 ms |
9992 KB |
Output is correct |
7 |
Correct |
33 ms |
10000 KB |
Output is correct |
8 |
Correct |
26 ms |
9504 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |