oj.uz

Submission #92929

# Submission time Handle Problem Language Result Execution time Memory
92929 2019-01-06T01:10:13 Z jasony123123 Paprike (COI18_paprike) C++11
100 / 100
 78 ms 17784 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define mp make_pair
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"

typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }

void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */

#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}

const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const ll INF = 1e18;
/****************************COI 2018 P1-Paprike*******************************/

const int MAXN = 1e5 + 99;
int N, K;
int H[MAXN];
v<int> adj[MAXN];
int cuts = 0;

int go(int x, int p) {
	v<int> chi;
	for (auto c : adj[x]) if (c != p)
		chi.push_back(go(c, x));
	sort(all(chi));
	int cur = H[x], i = -1;
	while (i + 1<chi.size() && cur + chi[i + 1] <= K) cur += chi[++i];
	cuts += chi.size() - 1 - i;
	return cur;
}

int main() {
	io();
	cin >> N >> K;
	FORE(i, 1, N) cin >> H[i];
	FOR(i, 0, N - 1) {
		int a, b;
		cin >> a >> b;
		adj[a].push_back(b), adj[b].push_back(a);
	}
	go(1, -1);
	cout << cuts << "\n";
	return 0;
}

Compilation message

paprike.cpp: In function 'int go(int, int)':
paprike.cpp:56:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (i + 1<chi.size() && cur + chi[i + 1] <= K) cur += chi[++i];
         ~~~~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 17784 KB Output is correct
2 Correct 55 ms 17660 KB Output is correct
3 Correct 56 ms 17784 KB Output is correct
4 Correct 55 ms 17656 KB Output is correct
5 Correct 53 ms 17456 KB Output is correct
6 Correct 56 ms 17500 KB Output is correct
7 Correct 53 ms 17528 KB Output is correct
8 Correct 55 ms 17016 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 3 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 3 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 4 ms 2684 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 3 ms 2680 KB Output is correct
14 Correct 4 ms 2736 KB Output is correct
15 Correct 4 ms 2652 KB Output is correct
16 Correct 4 ms 2680 KB Output is correct
17 Correct 3 ms 2680 KB Output is correct
18 Correct 4 ms 2680 KB Output is correct
19 Correct 4 ms 2680 KB Output is correct
20 Correct 4 ms 2680 KB Output is correct
21 Correct 4 ms 2652 KB Output is correct
22 Correct 54 ms 17784 KB Output is correct
23 Correct 55 ms 17660 KB Output is correct
24 Correct 56 ms 17784 KB Output is correct
25 Correct 55 ms 17656 KB Output is correct
26 Correct 53 ms 17456 KB Output is correct
27 Correct 56 ms 17500 KB Output is correct
28 Correct 53 ms 17528 KB Output is correct
29 Correct 55 ms 17016 KB Output is correct
30 Correct 5 ms 2808 KB Output is correct
31 Correct 4 ms 2780 KB Output is correct
32 Correct 4 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2804 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct
36 Correct 4 ms 2808 KB Output is correct
37 Correct 4 ms 2808 KB Output is correct
38 Correct 4 ms 2680 KB Output is correct
39 Correct 4 ms 2808 KB Output is correct
40 Correct 4 ms 2684 KB Output is correct
41 Correct 4 ms 2780 KB Output is correct
42 Correct 4 ms 2808 KB Output is correct
43 Correct 4 ms 2780 KB Output is correct
44 Correct 4 ms 2936 KB Output is correct
45 Correct 4 ms 2680 KB Output is correct
46 Correct 4 ms 2808 KB Output is correct
47 Correct 50 ms 11768 KB Output is correct
48 Correct 50 ms 10232 KB Output is correct
49 Correct 51 ms 9556 KB Output is correct
50 Correct 54 ms 9208 KB Output is correct
51 Correct 78 ms 8528 KB Output is correct
52 Correct 73 ms 8440 KB Output is correct
53 Correct 68 ms 8312 KB Output is correct
54 Correct 71 ms 8312 KB Output is correct
55 Correct 56 ms 7672 KB Output is correct
56 Correct 56 ms 7800 KB Output is correct
57 Correct 37 ms 9096 KB Output is correct