Submission #465439

#	Time	Username	Problem	Language	Result	Execution time	Memory
465439		Khizri	Paprike (COI18_paprike)	C++17	100 / 100	75 ms	38344 KiB

paprike

#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5;
int t=1,n,k,arr[mxn],a,b,ans=0;
vector<int>vt[mxn];
int dfs(int u,int p){
	int sum=arr[u];
	vector<int>vv;
	for(int v:vt[u]){
		if(v!=p){
			int q=dfs(v,u);
			vv.pb(q);
		}
	}
	sort(all(vv));
	for(int x:vv){
		if(sum+x<=k){
			sum+=x;
		}
		else{
			ans++;
		}
	}
	return sum;
}
void solve(){
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
	}
	for(int i=1;i<n;i++){
		cin>>a>>b;
		vt[a].pb(b);
		vt[b].pb(a);
	}
	dfs(1,-1);
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 13 / 13
• Subtask 3: 27 / 27
• Subtask 4: 49 / 49