Submission #465443

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
465443	2021-08-16T06:41:23 Z	fuad27	Paprike (COI18_paprike)	C++17	100 / 100	149 ms	19160 KB

paprike

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vii vector<pair<int, int>>
#define vi vector<int>
#define vl vector<long long>
#define vll vector<pair<long long, long long>>
#define mp make_pair
#define pb push_back
#define rep(i, a, b) for(int i = a;i<=(b);i++)
#define f first
#define s second
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);
#define start int tt;cin>>tt;rep(testcase, 1, tt)
#define print(k) cout<<"Case #"<<testcase<<": "<<k<<"\n";
#define endl "\n"
#define int long long
#define DEBUG(k) cerr<<k<<"\n";
vector<int> w(100010, 0);
int ans = 0, n, k;
vector<int> g[100010];
int s[100010], a[100010];
void dfs(int v,int p)
{
	s[v]=a[v];
	vector <long long> q;
	for(auto x:g[v])
	{
		if(x!=p)
		{
			dfs(x,v);
			s[v]+=s[x];
			q.push_back(s[x]);
		}
	}
	sort(q.begin(),q.end());
	auto it = q.end();
	it--;
	while(s[v]>k)
	{
		s[v]-=*it;
		ans++;
		it--;
	}
}
void solve() {
	cin >> n >> k;
	rep(i, 1, n)cin>>a[i];
	rep(i, 0, n-2) {
		int x, y;
		cin >> x >> y;
		g[x].push_back(y);
		g[y].push_back(x);
	}
	dfs(1, 0);
	cout<<ans<<endl;
}
int32_t main () {/*
	#ifndef ONLINE_JUDGE
	freopen("stdin", "r", stdin);
	freopen("stdout", "w", stdout);
	freopen("stderr", "w", stderr);
	#endif*/
	int t = 1;
	//cin >> t;
	while(t--) {
		solve();
	}
	return 0;
}

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3404 KB	Output is correct
2	Correct	2 ms	3404 KB	Output is correct
3	Correct	2 ms	3404 KB	Output is correct
4	Correct	2 ms	3404 KB	Output is correct
5	Correct	2 ms	3404 KB	Output is correct
6	Correct	2 ms	3404 KB	Output is correct
7	Correct	2 ms	3404 KB	Output is correct
8	Correct	2 ms	3404 KB	Output is correct
9	Correct	3 ms	3404 KB	Output is correct
10	Correct	2 ms	3404 KB	Output is correct
11	Correct	2 ms	3404 KB	Output is correct
12	Correct	2 ms	3404 KB	Output is correct
13	Correct	3 ms	3404 KB	Output is correct
14	Correct	3 ms	3404 KB	Output is correct
15	Correct	2 ms	3404 KB	Output is correct
16	Correct	2 ms	3404 KB	Output is correct
17	Correct	3 ms	3404 KB	Output is correct
18	Correct	2 ms	3404 KB	Output is correct
19	Correct	3 ms	3404 KB	Output is correct
20	Correct	2 ms	3404 KB	Output is correct
21	Correct	2 ms	3404 KB	Output is correct

Subtask #2
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	122 ms	19000 KB	Output is correct
2	Correct	125 ms	19160 KB	Output is correct
3	Correct	130 ms	19152 KB	Output is correct
4	Correct	148 ms	19020 KB	Output is correct
5	Correct	149 ms	19020 KB	Output is correct
6	Correct	120 ms	19008 KB	Output is correct
7	Correct	126 ms	18992 KB	Output is correct
8	Correct	120 ms	18992 KB	Output is correct

Subtask #3
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3404 KB	Output is correct
2	Correct	2 ms	3404 KB	Output is correct
3	Correct	2 ms	3404 KB	Output is correct
4	Correct	2 ms	3404 KB	Output is correct
5	Correct	2 ms	3404 KB	Output is correct
6	Correct	2 ms	3404 KB	Output is correct
7	Correct	2 ms	3404 KB	Output is correct
8	Correct	2 ms	3404 KB	Output is correct
9	Correct	3 ms	3404 KB	Output is correct
10	Correct	2 ms	3404 KB	Output is correct
11	Correct	2 ms	3404 KB	Output is correct
12	Correct	2 ms	3404 KB	Output is correct
13	Correct	3 ms	3404 KB	Output is correct
14	Correct	3 ms	3404 KB	Output is correct
15	Correct	2 ms	3404 KB	Output is correct
16	Correct	2 ms	3404 KB	Output is correct
17	Correct	3 ms	3404 KB	Output is correct
18	Correct	2 ms	3404 KB	Output is correct
19	Correct	3 ms	3404 KB	Output is correct
20	Correct	2 ms	3404 KB	Output is correct
21	Correct	2 ms	3404 KB	Output is correct
22	Correct	3 ms	3460 KB	Output is correct
23	Correct	3 ms	3404 KB	Output is correct
24	Correct	3 ms	3404 KB	Output is correct
25	Correct	3 ms	3404 KB	Output is correct
26	Correct	3 ms	3404 KB	Output is correct
27	Correct	4 ms	3388 KB	Output is correct
28	Correct	3 ms	3404 KB	Output is correct
29	Correct	3 ms	3404 KB	Output is correct
30	Correct	3 ms	3404 KB	Output is correct
31	Correct	3 ms	3404 KB	Output is correct
32	Correct	3 ms	3404 KB	Output is correct
33	Correct	4 ms	3404 KB	Output is correct
34	Correct	3 ms	3404 KB	Output is correct
35	Correct	3 ms	3404 KB	Output is correct
36	Correct	3 ms	3404 KB	Output is correct
37	Correct	4 ms	3404 KB	Output is correct
38	Correct	3 ms	3404 KB	Output is correct

Subtask #4
49.0 / 49.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	3404 KB	Output is correct
2	Correct	2 ms	3404 KB	Output is correct
3	Correct	2 ms	3404 KB	Output is correct
4	Correct	2 ms	3404 KB	Output is correct
5	Correct	2 ms	3404 KB	Output is correct
6	Correct	2 ms	3404 KB	Output is correct
7	Correct	2 ms	3404 KB	Output is correct
8	Correct	2 ms	3404 KB	Output is correct
9	Correct	3 ms	3404 KB	Output is correct
10	Correct	2 ms	3404 KB	Output is correct
11	Correct	2 ms	3404 KB	Output is correct
12	Correct	2 ms	3404 KB	Output is correct
13	Correct	3 ms	3404 KB	Output is correct
14	Correct	3 ms	3404 KB	Output is correct
15	Correct	2 ms	3404 KB	Output is correct
16	Correct	2 ms	3404 KB	Output is correct
17	Correct	3 ms	3404 KB	Output is correct
18	Correct	2 ms	3404 KB	Output is correct
19	Correct	3 ms	3404 KB	Output is correct
20	Correct	2 ms	3404 KB	Output is correct
21	Correct	2 ms	3404 KB	Output is correct
22	Correct	122 ms	19000 KB	Output is correct
23	Correct	125 ms	19160 KB	Output is correct
24	Correct	130 ms	19152 KB	Output is correct
25	Correct	148 ms	19020 KB	Output is correct
26	Correct	149 ms	19020 KB	Output is correct
27	Correct	120 ms	19008 KB	Output is correct
28	Correct	126 ms	18992 KB	Output is correct
29	Correct	120 ms	18992 KB	Output is correct
30	Correct	3 ms	3460 KB	Output is correct
31	Correct	3 ms	3404 KB	Output is correct
32	Correct	3 ms	3404 KB	Output is correct
33	Correct	3 ms	3404 KB	Output is correct
34	Correct	3 ms	3404 KB	Output is correct
35	Correct	4 ms	3388 KB	Output is correct
36	Correct	3 ms	3404 KB	Output is correct
37	Correct	3 ms	3404 KB	Output is correct
38	Correct	3 ms	3404 KB	Output is correct
39	Correct	3 ms	3404 KB	Output is correct
40	Correct	3 ms	3404 KB	Output is correct
41	Correct	4 ms	3404 KB	Output is correct
42	Correct	3 ms	3404 KB	Output is correct
43	Correct	3 ms	3404 KB	Output is correct
44	Correct	3 ms	3404 KB	Output is correct
45	Correct	4 ms	3404 KB	Output is correct
46	Correct	3 ms	3404 KB	Output is correct
47	Correct	130 ms	12484 KB	Output is correct
48	Correct	128 ms	10764 KB	Output is correct
49	Correct	122 ms	10108 KB	Output is correct
50	Correct	128 ms	9680 KB	Output is correct
51	Correct	137 ms	8644 KB	Output is correct
52	Correct	134 ms	8724 KB	Output is correct
53	Correct	145 ms	8792 KB	Output is correct
54	Correct	147 ms	8728 KB	Output is correct
55	Correct	123 ms	8648 KB	Output is correct
56	Correct	116 ms	8684 KB	Output is correct
57	Correct	103 ms	10128 KB	Output is correct

Submission #465443

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 13.0 / 13.0

Subtask #3 27.0 / 27.0

Subtask #4 49.0 / 49.0

Subtask #1
11.0 / 11.0

Subtask #2
13.0 / 13.0

Subtask #3
27.0 / 27.0

Subtask #4
49.0 / 49.0