oj.uz

Submission #624872

# Submission time Handle Problem Language Result Execution time Memory
624872 2022-08-08T23:22:47 Z Cyber_Wolf Paprike (COI18_paprike) C++14
100 / 100
 53 ms 22644 KB 
//Contest: COI 18 Problem 1
//Problem Name: Paprike


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")

using namespace std;
using namespace __gnu_pbds;

#define lg long long
#define ordered_set	tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args);
#define endl \n
#define lbound(x, y) lower_bound(x.begin(), x.end(), y) 
#define ubound(x, y) upper_bound(x.begin(), x.end(), y) 
#define sortasc(v) sort(v.begin(), v.end())	
#define sortdesc(v) sort(v.rbegin(), v.rend())	
#define custom_array(a,l, r) int _##a[r-l+1]; int*a=_##a-l;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const lg MOD = 1e9+7, N = 2e5+5, M = 1e7+1, SZ = 1e3+1;
/*
bitset<N> primes;
lg pwrs[N], inv[N];

lg fast_power(lg n, lg k)
{
	if(!k)	return 1;
	if(k&1)	return (fast_power(n, k-1)*n)%MOD;
	lg x = fast_power(n, k/2)%MOD;
	return (x*x)%MOD;
}

void sieve()
{
	primes.set();
	primes[0] = primes[1] = 0;
	for(lg i = 2; i < N; i++)
	{
		if(!primes[i])	continue;
		for(lg j = i*i; j < N; j += i)
		{
			primes[j] = 0;
		}
	}
	return;
}

struct matrix
{
	vector<vector<lg>> con = vector<vector<lg>> (SZ, vector<lg> (SZ));
	matrix operator *(const matrix& a)
	{
		matrix product;
		for(int i = 0; i < (lg)con.size(); i++)
		{
			for(int j = 0; j < (lg)a.con[0].size(); j++)
			{
				for(int k = 0; k < (lg)a.con.size(); k++)
				{
					product.con[i][j] = (product.con[i][j]+(con[i][k]*a.con[k][j])%MOD)%MOD; 
				}
			}
		}
		return product;
	}
};

void preprocess(lg x)
{
	inv[2e5] = fast_power(x, MOD-2);
	for(int i = 2e5-1; i > 1; i--)
	{
		inv[i] = (inv[i+1]*i)%MOD;
	}
	pwrs[0] = 1;
	for(int i = 1; i <= 2e5; i++)
	{
		pwrs[i] = (pwrs[i]*i)%MOD;
	}
	return;
}

*/
vector<lg> v(N);
vector<lg> adj[N];
lg ans = 0, n, k;

lg dfs(lg src, lg par = -1)
{
	vector<lg> x;
	lg sum = v[src];
	for(auto it : adj[src])
	{
		if(it == par)	continue;
		x.push_back(dfs(it, src));
		sum += x.back();
	}
	sort(x.rbegin(), x.rend());
	lg idx = 0;
	while(sum > k)
	{
		ans++;
		sum -= x[idx];
		idx++;
	}
	return sum;
}

int main()
{
	fastio;
	cin >> n >> k;
	for(int i = 1; i <= n; i++)	cin >> v[i];
	for(int i = 0; i < n-1; i++)
	{
		lg u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	dfs(1);
	cout << ans << '\n';

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 22576 KB Output is correct
2 Correct 46 ms 22604 KB Output is correct
3 Correct 43 ms 22644 KB Output is correct
4 Correct 53 ms 22604 KB Output is correct
5 Correct 44 ms 22476 KB Output is correct
6 Correct 44 ms 22588 KB Output is correct
7 Correct 41 ms 22564 KB Output is correct
8 Correct 38 ms 22064 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 4 ms 6484 KB Output is correct
3 Correct 3 ms 6484 KB Output is correct
4 Correct 3 ms 6484 KB Output is correct
5 Correct 3 ms 6484 KB Output is correct
6 Correct 3 ms 6484 KB Output is correct
7 Correct 3 ms 6484 KB Output is correct
8 Correct 4 ms 6484 KB Output is correct
9 Correct 3 ms 6484 KB Output is correct
10 Correct 3 ms 6484 KB Output is correct
11 Correct 3 ms 6484 KB Output is correct
12 Correct 3 ms 6484 KB Output is correct
13 Correct 3 ms 6484 KB Output is correct
14 Correct 3 ms 6484 KB Output is correct
15 Correct 3 ms 6632 KB Output is correct
16 Correct 3 ms 6484 KB Output is correct
17 Correct 3 ms 6484 KB Output is correct
18 Correct 4 ms 6484 KB Output is correct
19 Correct 3 ms 6484 KB Output is correct
20 Correct 3 ms 6484 KB Output is correct
21 Correct 4 ms 6484 KB Output is correct
22 Correct 40 ms 22576 KB Output is correct
23 Correct 46 ms 22604 KB Output is correct
24 Correct 43 ms 22644 KB Output is correct
25 Correct 53 ms 22604 KB Output is correct
26 Correct 44 ms 22476 KB Output is correct
27 Correct 44 ms 22588 KB Output is correct
28 Correct 41 ms 22564 KB Output is correct
29 Correct 38 ms 22064 KB Output is correct
30 Correct 3 ms 6620 KB Output is correct
31 Correct 4 ms 6740 KB Output is correct
32 Correct 3 ms 6616 KB Output is correct
33 Correct 4 ms 6612 KB Output is correct
34 Correct 3 ms 6612 KB Output is correct
35 Correct 4 ms 6620 KB Output is correct
36 Correct 4 ms 6616 KB Output is correct
37 Correct 3 ms 6612 KB Output is correct
38 Correct 3 ms 6620 KB Output is correct
39 Correct 3 ms 6620 KB Output is correct
40 Correct 3 ms 6612 KB Output is correct
41 Correct 3 ms 6612 KB Output is correct
42 Correct 3 ms 6616 KB Output is correct
43 Correct 4 ms 6612 KB Output is correct
44 Correct 3 ms 6612 KB Output is correct
45 Correct 3 ms 6604 KB Output is correct
46 Correct 3 ms 6612 KB Output is correct
47 Correct 42 ms 16060 KB Output is correct
48 Correct 43 ms 14272 KB Output is correct
49 Correct 42 ms 13652 KB Output is correct
50 Correct 42 ms 13240 KB Output is correct
51 Correct 50 ms 12212 KB Output is correct
52 Correct 47 ms 12236 KB Output is correct
53 Correct 49 ms 12104 KB Output is correct
54 Correct 46 ms 12128 KB Output is correct
55 Correct 43 ms 11704 KB Output is correct
56 Correct 44 ms 11652 KB Output is correct
57 Correct 31 ms 13636 KB Output is correct