oj.uz

Submission #319096

# Submission time Handle Problem Language Result Execution time Memory
319096 2020-11-03T23:56:36 Z Foxyy Paprike (COI18_paprike) C++14
100 / 100
 73 ms 17636 KB 
//#define DEBUG

#include <bits/stdc++.h>
using namespace std;

const int MAXN = 100000;
const int INF = 0x3f3f3f3f, MOD = 1000000007;
#define INIT(arr, val) fill(arr, arr+(int)(sizeof(arr)/sizeof(arr[0])), val)
#define REP(i, lb, rb, inc) for(int i = (lb); i < (rb); i += inc)
#define RREP(i, rb, lb, dec) for(int i = (rb)-1; i >= (lb); i -= dec)
typedef long long ll;
#define sz size()
typedef stack<int, vector<int> > SI;
typedef queue<int> QI;
typedef vector<int> VI;
#define pb push_back
typedef pair<int, int> PII;
#define mp make_pair
#define F first
#define S second
#define endl '\n'
#define dbg(a, b) cerr << "dbg: a " << b << endl;
#define dbg_itv(a, b, c) cerr << "dbg_itv: " << a << " " << b << " : " << c << endl
#define IOS() cin.tie(0); cout.sync_with_stdio(0)

int n, k;

int ans;

ll w[MAXN];
VI g[MAXN];

// solve() returns the maximum cost of the child tree
ll solve(int u = 0, int anc = 0) {
	vector<ll> chld;
	for (int v : g[u]) {
		if (v == anc) continue;
		ll ret = solve(v, u);
		chld.pb(ret);
	}
	ll cur = w[u];
	sort(chld.begin(), chld.end());
	REP(i, 0, chld.size(), 1) {
		cur += chld[i];
		if (cur > k) {
			cur -= chld[i];
			ans += (chld.size()-i);
			break;
		}
	}
	return cur;
}

signed main() {
	IOS();
	cin >> n >> k;
	REP(i, 0, n, 1) cin >> w[i];
	int u, v;
	REP(i, 0, n-1, 1) {
		cin >> u >> v;
		u--, v--;
		g[u].pb(v); g[v].pb(u);
	}
	
	solve();
	cout << ans << endl;
}

Compilation message

paprike.cpp: In function 'll solve(int, int)':
paprike.cpp:9:49: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define REP(i, lb, rb, inc) for(int i = (lb); i < (rb); i += inc)
      |                                                 ^
paprike.cpp:43:2: note: in expansion of macro 'REP'
   43 |  REP(i, 0, chld.size(), 1) {
      |  ^~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 17636 KB Output is correct
2 Correct 51 ms 17508 KB Output is correct
3 Correct 53 ms 17508 KB Output is correct
4 Correct 51 ms 17636 KB Output is correct
5 Correct 50 ms 17508 KB Output is correct
6 Correct 50 ms 17508 KB Output is correct
7 Correct 52 ms 17512 KB Output is correct
8 Correct 53 ms 17508 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 2 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 2 ms 2668 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 2 ms 2668 KB Output is correct
15 Correct 2 ms 2668 KB Output is correct
16 Correct 2 ms 2668 KB Output is correct
17 Correct 2 ms 2668 KB Output is correct
18 Correct 2 ms 2668 KB Output is correct
19 Correct 2 ms 2668 KB Output is correct
20 Correct 3 ms 2668 KB Output is correct
21 Correct 2 ms 2668 KB Output is correct
22 Correct 53 ms 17636 KB Output is correct
23 Correct 51 ms 17508 KB Output is correct
24 Correct 53 ms 17508 KB Output is correct
25 Correct 51 ms 17636 KB Output is correct
26 Correct 50 ms 17508 KB Output is correct
27 Correct 50 ms 17508 KB Output is correct
28 Correct 52 ms 17512 KB Output is correct
29 Correct 53 ms 17508 KB Output is correct
30 Correct 3 ms 2796 KB Output is correct
31 Correct 2 ms 2796 KB Output is correct
32 Correct 2 ms 2796 KB Output is correct
33 Correct 2 ms 2668 KB Output is correct
34 Correct 2 ms 2796 KB Output is correct
35 Correct 2 ms 2668 KB Output is correct
36 Correct 2 ms 2796 KB Output is correct
37 Correct 3 ms 2668 KB Output is correct
38 Correct 2 ms 2668 KB Output is correct
39 Correct 2 ms 2668 KB Output is correct
40 Correct 3 ms 2668 KB Output is correct
41 Correct 2 ms 2668 KB Output is correct
42 Correct 3 ms 2668 KB Output is correct
43 Correct 2 ms 2668 KB Output is correct
44 Correct 2 ms 2668 KB Output is correct
45 Correct 2 ms 2668 KB Output is correct
46 Correct 2 ms 2796 KB Output is correct
47 Correct 50 ms 10728 KB Output is correct
48 Correct 49 ms 8932 KB Output is correct
49 Correct 49 ms 8292 KB Output is correct
50 Correct 51 ms 7912 KB Output is correct
51 Correct 65 ms 6884 KB Output is correct
52 Correct 70 ms 6888 KB Output is correct
53 Correct 64 ms 6884 KB Output is correct
54 Correct 64 ms 6884 KB Output is correct
55 Correct 61 ms 6904 KB Output is correct
56 Correct 73 ms 7012 KB Output is correct
57 Correct 37 ms 8288 KB Output is correct