# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
241012 | topovik | Paprike (COI18_paprike) | C++14 | 167 ms | 15608 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define INF 1000000000
#define N (long)1e6
using namespace std;
typedef long long ll;
typedef long double ld;
vector <vector <int> > a;
int n,k;
int b[N];
int ans;
int Rec(int x, int y)
{
vector <int> c;
int sum=b[x];
for (int i=0; i<a[x].size(); i++)
if (a[x][i]!=y) c.pb(Rec(a[x][i],x)),sum+=c.back();
sort(c.begin(),c.end());
reverse(c.begin(),c.end());
for (int i=0; sum>k; i++) sum-=c[i],ans++;
return sum;
}
int main()
{
cin>>n>>k;
for (int i=0; i<n; i++) cin>>b[i];
a.resize(n);
for (int i=0; i<n-1; i++)
{
int x,y;
cin>>x>>y;
a[--x].pb(--y);
a[y].pb(x);
}
Rec(0,0);
cout<<ans;
}
Compilation message (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... |