Submission #899459

#	Time	Username	Problem	Language	Result	Execution time	Memory
899459		LCJLY	Paprike (COI18_paprike)	C++14	100 / 100	37 ms	20344 KiB

paprike

#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl; 
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;
typedef pair<int,int>pii;
//typedef pair<int,pii>pi2;
typedef array<int,4>pi2;

int n,k;
int arr[100005];
vector<int>adj[100005];
int storage[100005];
int ans=0;

void dp(int index, int par){
	vector<int>v;
	int counter=arr[index];
	for(auto it:adj[index]){
		if(it==par) continue;
		dp(it,index);	
		v.push_back(storage[it]);
	}
	
	sort(v.begin(),v.end());
	for(auto it:v){
		if(counter+it<=k){
			counter+=it;
		}
		else ans++;
	}
	
	storage[index]=counter;
}

void solve(){	
	cin >> n >> k;
	for(int x=1;x<=n;x++){
		cin >> arr[x];
	}
	
	int temp,temp2;
	for(int x=0;x<n-1;x++){
		cin >> temp >> temp2;
		adj[temp].push_back(temp2);
		adj[temp2].push_back(temp);
	}
	
	dp(1,-1);

	cout << ans;
}
 
int32_t main(){										
	ios::sync_with_stdio(0);	
	cin.tie(0);
	//freopen("redistricting.in", "r", stdin);
	//freopen("redistricting.out", "w", stdout);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}	
}

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