Submission #868567

#	Time	Username	Problem	Language	Result	Execution time	Memory
868567		amirhoseinfar1385	Paprike (COI18_paprike)	C++17	100 / 100	36 ms	17344 KiB

paprike

#include<bits/stdc++.h>
using namespace std;
const int maxn=100000+10;
vector<int>adj[maxn];
int val[maxn];
int n,k;
int res=0;

int solve(int u=1,int par=-1){
	vector<int>v;
	for(auto x:adj[u]){
		if(x!=par){
			v.push_back(solve(x,u));
		}
	}
	sort(v.begin(),v.end());
	int suma=val[u];
	for(int i=0;i<(int)v.size();i++){
		if(suma+v[i]<=k){
			suma+=v[i];
			continue;
		}
		else{
			res++;
		}
	}
	return suma;
}


int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>k;
	for(int i=1;i<=n;i++){
		cin>>val[i];
	}
	for(int i=1;i<=n-1;i++){
		int u,v;
		cin>>u>>v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	solve();
	cout<<res<<"\n";
}

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