Submission #43904

# Submission time Handle Problem Language Result Execution time Memory
43904 2018-03-27T11:27:55 Z mraron Paprike (COI18_paprike) C++14
24 / 100
67 ms 20312 KB
//Noszály Áron 10o Debreceni Fazekas Mihály Gimnázium

#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<cassert>
#include<cassert>
#include<unordered_map>
#include<unordered_set>
#include<functional>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<numeric>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define xx first
#define yy second
#define sz(x) (int)(x).size()
#define FORN(i, n) for(int i=0;i<(n);i++)
#define gc getchar
#define IO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define rep(i, l, r) for ((i) = (l); (i) < (r); (i)++)

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const double PI=acos(-1);

template<typename T> T getint() {
	T val=0;
	char c;
	
	bool neg=false;
	while((c=gc()) && !(c>='0' && c<='9')) {
		neg|=c=='-';
	}

	do {
		val=(val*10)+c-'0';
	} while((c=gc()) && (c>='0' && c<='9'));

	return val*(neg?-1:1);
}

const int maxn=100001;

int n, k;
int cost[maxn];
vector<int> adj[maxn];

pair<int,int> dfs(int x, int par=-1) {
	int child=0;
	
	int sum=cost[x];
	int ans=0;
	
	priority_queue<int> pq;
	for(auto i:adj[x]) {
		if(par==i) continue ;
		child++;
		pair<int,int> akt=dfs(i, x);
		pq.push(akt.yy);
		
		ans+=akt.xx;
		sum+=akt.yy;
	}
	
	while(!pq.empty() && sum>k) {
		sum-=pq.top();ans++;
		pq.pop();
	}
	
	
	return {ans, sum};
}

int main() {
	IO;
	cin>>n>>k;
	for(int i=1;i<=n;++i) {
		cin>>cost[i];
	}
	
	for(int i=1;i<n;++i) {
		int a,b;cin>>a>>b;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	
	cout<<dfs(1).xx<<"\n";
		
	return 0;
}

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2680 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 3 ms 2740 KB Output is correct
4 Correct 3 ms 2744 KB Output is correct
5 Correct 3 ms 2748 KB Output is correct
6 Correct 4 ms 2756 KB Output is correct
7 Correct 3 ms 2808 KB Output is correct
8 Correct 3 ms 2880 KB Output is correct
9 Correct 3 ms 2936 KB Output is correct
10 Correct 3 ms 2936 KB Output is correct
11 Correct 3 ms 3036 KB Output is correct
12 Correct 3 ms 3036 KB Output is correct
13 Correct 3 ms 3036 KB Output is correct
14 Correct 3 ms 3036 KB Output is correct
15 Correct 3 ms 3036 KB Output is correct
16 Correct 3 ms 3036 KB Output is correct
17 Correct 3 ms 3116 KB Output is correct
18 Correct 3 ms 3116 KB Output is correct
19 Correct 4 ms 3116 KB Output is correct
20 Correct 3 ms 3116 KB Output is correct
21 Correct 3 ms 3116 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 63 ms 20308 KB Output is correct
2 Correct 64 ms 20308 KB Output is correct
3 Correct 63 ms 20308 KB Output is correct
4 Correct 64 ms 20312 KB Output is correct
5 Correct 66 ms 20312 KB Output is correct
6 Correct 62 ms 20312 KB Output is correct
7 Correct 62 ms 20312 KB Output is correct
8 Correct 67 ms 20312 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 2680 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 3 ms 2740 KB Output is correct
4 Correct 3 ms 2744 KB Output is correct
5 Correct 3 ms 2748 KB Output is correct
6 Correct 4 ms 2756 KB Output is correct
7 Correct 3 ms 2808 KB Output is correct
8 Correct 3 ms 2880 KB Output is correct
9 Correct 3 ms 2936 KB Output is correct
10 Correct 3 ms 2936 KB Output is correct
11 Correct 3 ms 3036 KB Output is correct
12 Correct 3 ms 3036 KB Output is correct
13 Correct 3 ms 3036 KB Output is correct
14 Correct 3 ms 3036 KB Output is correct
15 Correct 3 ms 3036 KB Output is correct
16 Correct 3 ms 3036 KB Output is correct
17 Correct 3 ms 3116 KB Output is correct
18 Correct 3 ms 3116 KB Output is correct
19 Correct 4 ms 3116 KB Output is correct
20 Correct 3 ms 3116 KB Output is correct
21 Correct 3 ms 3116 KB Output is correct
22 Correct 4 ms 20312 KB Output is correct
23 Correct 4 ms 20312 KB Output is correct
24 Correct 4 ms 20312 KB Output is correct
25 Correct 4 ms 20312 KB Output is correct
26 Correct 4 ms 20312 KB Output is correct
27 Correct 4 ms 20312 KB Output is correct
28 Correct 4 ms 20312 KB Output is correct
29 Correct 4 ms 20312 KB Output is correct
30 Correct 4 ms 20312 KB Output is correct
31 Correct 4 ms 20312 KB Output is correct
32 Correct 4 ms 20312 KB Output is correct
33 Correct 5 ms 20312 KB Output is correct
34 Correct 5 ms 20312 KB Output is correct
35 Correct 5 ms 20312 KB Output is correct
36 Correct 5 ms 20312 KB Output is correct
37 Correct 4 ms 20312 KB Output is correct
38 Incorrect 4 ms 20312 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 2680 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 3 ms 2740 KB Output is correct
4 Correct 3 ms 2744 KB Output is correct
5 Correct 3 ms 2748 KB Output is correct
6 Correct 4 ms 2756 KB Output is correct
7 Correct 3 ms 2808 KB Output is correct
8 Correct 3 ms 2880 KB Output is correct
9 Correct 3 ms 2936 KB Output is correct
10 Correct 3 ms 2936 KB Output is correct
11 Correct 3 ms 3036 KB Output is correct
12 Correct 3 ms 3036 KB Output is correct
13 Correct 3 ms 3036 KB Output is correct
14 Correct 3 ms 3036 KB Output is correct
15 Correct 3 ms 3036 KB Output is correct
16 Correct 3 ms 3036 KB Output is correct
17 Correct 3 ms 3116 KB Output is correct
18 Correct 3 ms 3116 KB Output is correct
19 Correct 4 ms 3116 KB Output is correct
20 Correct 3 ms 3116 KB Output is correct
21 Correct 3 ms 3116 KB Output is correct
22 Correct 63 ms 20308 KB Output is correct
23 Correct 64 ms 20308 KB Output is correct
24 Correct 63 ms 20308 KB Output is correct
25 Correct 64 ms 20312 KB Output is correct
26 Correct 66 ms 20312 KB Output is correct
27 Correct 62 ms 20312 KB Output is correct
28 Correct 62 ms 20312 KB Output is correct
29 Correct 67 ms 20312 KB Output is correct
30 Correct 4 ms 20312 KB Output is correct
31 Correct 4 ms 20312 KB Output is correct
32 Correct 4 ms 20312 KB Output is correct
33 Correct 4 ms 20312 KB Output is correct
34 Correct 4 ms 20312 KB Output is correct
35 Correct 4 ms 20312 KB Output is correct
36 Correct 4 ms 20312 KB Output is correct
37 Correct 4 ms 20312 KB Output is correct
38 Correct 4 ms 20312 KB Output is correct
39 Correct 4 ms 20312 KB Output is correct
40 Correct 4 ms 20312 KB Output is correct
41 Correct 5 ms 20312 KB Output is correct
42 Correct 5 ms 20312 KB Output is correct
43 Correct 5 ms 20312 KB Output is correct
44 Correct 5 ms 20312 KB Output is correct
45 Correct 4 ms 20312 KB Output is correct
46 Incorrect 4 ms 20312 KB Output isn't correct