Submission #307104

#	Time	Username	Problem	Language	Result	Execution time	Memory
307104		Hemimor	Paprike (COI18_paprike)	C++14	100 / 100	231 ms	17784 KiB

paprike

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <random>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=998244353;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

vi vin(int n,int d=0){
	vi a(n);
	for(auto &i:a){
		cin>>i;
		i-=d;
	}
	return a;
}

vvi gin(int n,int m,int d=1){
	vvi g(n);
	for(int i=0;i<m;i++){
		int u,v;
		cin>>u>>v;
		u-=d,v-=d;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	return g;
}

int n,k,res=0;
vvi g;
vi a;

int dfs(int v,int p=-1){
	vi b;
	for(auto u:g[v]) if(u!=p) b.push_back(dfs(u,v));
	int t=a[v];
	if(b.size()){
		sort(b.rbegin(),b.rend());
		while(!b.empty()&&t+b.back()<=k){
			t+=b.back();
			b.pop_back();
		}
		res+=(int)b.size();
	}
	return t;
}

int main(){
	cin>>n>>k;
	a=vin(n);
	g=gin(n,n-1);
	dfs(0);
	cout<<res<<endl;
}

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