# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1203176 | nvc2k8 | Paprike (COI18_paprike) | C++20 | 32 ms | 19528 KiB |
#include <bits/stdc++.h>
#define TASK "aksdjaksdj"
#define INT_LIM (int) 2147483647
#define LL_LIM (long long) 9223372036854775807
#define endl '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define BIT(i,x) (((i)>>(x))&1)
#define FOR(i,a,b) for(int i = (a); i<=(b); i++)
#define FORD(i,a,b) for(int i = (a); i>=(b); i--)
#define ll long long
#define pii pair<int,int>
using namespace std;
///------------------------------------------///
int n,k;
int a[100005];
vector<int> adj[100005];
void inp()
{
cin >> n >> k;
FOR(i, 1, n) cin >> a[i];
FOR(i, 1, n-1)
{
int u,v;
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
}
int dp[100005], f[100005];
void calc(int u, int p)
{
f[u] = a[u];
vector<pii> q;
for (auto v:adj[u]) if (v!=p)
{
calc(v, u);
q.pb(mp(f[v], v));
}
sort(q.begin(), q.end());
for (auto V:q)
{
int v = V.se, s = V.fi;
dp[u]+= dp[v];
if (f[u]+s<=k)
{
f[u]+=s;
}
else dp[u]++;
}
}
void solve()
{
calc(1, -1);
cout << dp[1];
}
signed main()
{
///--------------------------///
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
if (fopen(TASK".INP","r")!=NULL)
{
freopen(TASK".INP","r",stdin);
freopen(TASK".OUT","w",stdout);
}
///--------------------------///
int NTEST = 1;
//cin >> NTEST;
while (NTEST--)
{
inp();
solve();
}
return 0;
}
///------------------------------------------///
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |