oj.uz

Submission #569282

# Submission time Handle Problem Language Result Execution time Memory
569282 2022-05-27T08:40:31 Z jcelin Paprike (COI18_paprike) C++14
100 / 100
 76 ms 25056 KB 
#include <bits/stdc++.h>
using namespace std;


typedef long long ll;
typedef long double ld;
typedef unsigned int ui;

#define ii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vii vector<ii>
#define vll vector<ll>
#define vpll vector<pll>
#define matrix vector<vi>
#define matrixLL vector<vLL>
#define vs vector<string>
#define vui vector<ui>
#define msi multiset<int>
#define mss multiset<string>
#define si set<int>
#define ss set<string>
#define PB push_back
#define PF push_front
#define PPB pop_back
#define PPF pop_front
#define X first
#define Y second
#define MP make_pair
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()

const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dxx[] = {-1, 1, 0, 0, 1, 1, -1, -1};
const int dyy[] = {0, 0, -1, 1, -1, 1, -1, 1};
const string abc="abcdefghijklmnopqrstuvwxyz";
const string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ld pi = 3.14159265;
const int mod = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAXN = 3e5 + 7;
const int inf = mod;
const ll INF = 1e18;
const ll zero = ll(0);
const int logo = 20;
const int off = 1 << logo;
const int trsz = off << 1;

ll s[MAXN];
ll val[MAXN], n, k;
vi g[MAXN];

bool cmp(int a, int b){
	return a > b;
}

int rek(int u, int p = -1){
	int ret = 0;
	vll tmp; tmp.clear();
	s[u] = (ll)val[u];
	
	for(auto x: g[u]) if(x != p){
		ret += rek(x, u);
		s[u] += (ll)s[x];
		tmp.PB(s[x]);
	}
	
	if(s[u] <= k) return ret;
	
	sort(all(tmp), cmp);
	
	for(int i=0; i<tmp.size(); i++){
		ret++, s[u] -= tmp[i];
		if(s[u] <= k) return ret;
	}
}


void solve(){
	cin >> n >> k;
	for(int i=1; i<=n; i++) cin >> val[i];
	for(int i=1, a, b; i<n; i++) cin >> a >> b, g[a].PB(b), g[b].PB(a);
	cout << rek(1, -1) << "\n";
}


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int t=1;
	//cin >> t;
	while(t--)solve();
	return 0;
}

Compilation message

paprike.cpp: In function 'int rek(int, int)':
paprike.cpp:74:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |  for(int i=0; i<tmp.size(); i++){
      |               ~^~~~~~~~~~~
paprike.cpp:61:6: warning: control reaches end of non-void function [-Wreturn-type]
   61 |  vll tmp; tmp.clear();
      |      ^~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 22988 KB Output is correct
2 Correct 53 ms 25056 KB Output is correct
3 Correct 51 ms 24976 KB Output is correct
4 Correct 60 ms 24904 KB Output is correct
5 Correct 49 ms 24968 KB Output is correct
6 Correct 43 ms 24900 KB Output is correct
7 Correct 47 ms 24896 KB Output is correct
8 Correct 48 ms 24412 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7384 KB Output is correct
2 Correct 4 ms 7268 KB Output is correct
3 Correct 4 ms 7376 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 4 ms 7252 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 4 ms 7376 KB Output is correct
13 Correct 4 ms 7360 KB Output is correct
14 Correct 4 ms 7380 KB Output is correct
15 Correct 5 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 6 ms 7380 KB Output is correct
18 Correct 6 ms 7376 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 4 ms 7376 KB Output is correct
21 Correct 4 ms 7380 KB Output is correct
22 Correct 5 ms 7388 KB Output is correct
23 Correct 5 ms 7380 KB Output is correct
24 Correct 5 ms 7380 KB Output is correct
25 Correct 5 ms 7384 KB Output is correct
26 Correct 5 ms 7368 KB Output is correct
27 Correct 5 ms 7452 KB Output is correct
28 Correct 4 ms 7388 KB Output is correct
29 Correct 5 ms 7380 KB Output is correct
30 Correct 4 ms 7380 KB Output is correct
31 Correct 5 ms 7448 KB Output is correct
32 Correct 5 ms 7372 KB Output is correct
33 Correct 5 ms 7380 KB Output is correct
34 Correct 4 ms 7380 KB Output is correct
35 Correct 4 ms 7380 KB Output is correct
36 Correct 5 ms 7380 KB Output is correct
37 Correct 6 ms 7380 KB Output is correct
38 Correct 5 ms 7392 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7384 KB Output is correct
2 Correct 4 ms 7268 KB Output is correct
3 Correct 4 ms 7376 KB Output is correct
4 Correct 4 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7380 KB Output is correct
9 Correct 4 ms 7252 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 4 ms 7376 KB Output is correct
13 Correct 4 ms 7360 KB Output is correct
14 Correct 4 ms 7380 KB Output is correct
15 Correct 5 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 6 ms 7380 KB Output is correct
18 Correct 6 ms 7376 KB Output is correct
19 Correct 6 ms 7380 KB Output is correct
20 Correct 4 ms 7376 KB Output is correct
21 Correct 4 ms 7380 KB Output is correct
22 Correct 45 ms 22988 KB Output is correct
23 Correct 53 ms 25056 KB Output is correct
24 Correct 51 ms 24976 KB Output is correct
25 Correct 60 ms 24904 KB Output is correct
26 Correct 49 ms 24968 KB Output is correct
27 Correct 43 ms 24900 KB Output is correct
28 Correct 47 ms 24896 KB Output is correct
29 Correct 48 ms 24412 KB Output is correct
30 Correct 5 ms 7388 KB Output is correct
31 Correct 5 ms 7380 KB Output is correct
32 Correct 5 ms 7380 KB Output is correct
33 Correct 5 ms 7384 KB Output is correct
34 Correct 5 ms 7368 KB Output is correct
35 Correct 5 ms 7452 KB Output is correct
36 Correct 4 ms 7388 KB Output is correct
37 Correct 5 ms 7380 KB Output is correct
38 Correct 4 ms 7380 KB Output is correct
39 Correct 5 ms 7448 KB Output is correct
40 Correct 5 ms 7372 KB Output is correct
41 Correct 5 ms 7380 KB Output is correct
42 Correct 4 ms 7380 KB Output is correct
43 Correct 4 ms 7380 KB Output is correct
44 Correct 5 ms 7380 KB Output is correct
45 Correct 6 ms 7380 KB Output is correct
46 Correct 5 ms 7392 KB Output is correct
47 Correct 54 ms 18192 KB Output is correct
48 Correct 48 ms 16176 KB Output is correct
49 Correct 66 ms 15576 KB Output is correct
50 Correct 51 ms 15196 KB Output is correct
51 Correct 76 ms 14128 KB Output is correct
52 Correct 68 ms 14172 KB Output is correct
53 Correct 52 ms 14040 KB Output is correct
54 Correct 66 ms 14068 KB Output is correct
55 Correct 49 ms 13516 KB Output is correct
56 Correct 67 ms 13564 KB Output is correct
57 Correct 39 ms 14972 KB Output is correct