Submission #640568

# Submission time Handle Problem Language Result Execution time Memory
640568 2022-09-15T01:00:03 Z SanguineChameleon Paprike (COI18_paprike) C++17
100 / 100
54 ms 20308 KB
// BEGIN BOILERPLATE CODE

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

#ifdef KAMIRULEZ
	const bool kami_loc = true;
	const long long kami_seed = 69420;
#else
	const bool kami_loc = false;
	const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif

const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);

long long rand_range(long long rmin, long long rmax) {
	uniform_int_distribution<long long> rdist(rmin, rmax);
	return rdist(kami_gen);
}

void file_io(string fi, string fo) {
	if (fi != "" && (!kami_loc || fi == kami_fi)) {
		freopen(fi.c_str(), "r", stdin);
	}
	if (fo != "" && (!kami_loc || fo == kami_fo)) {
		freopen(fo.c_str(), "w", stdout);
	}
}

void set_up() {
	if (kami_loc) {
		file_io(kami_fi, kami_fo);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}

void just_do_it();

void just_exec_it() {
	if (kami_loc) {
		auto pstart = chrono::steady_clock::now();
		just_do_it();
		auto pend = chrono::steady_clock::now();
		long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
		string bar(50, '=');
		cout << '\n' << bar << '\n';
		cout << "Time: " << ptime << " ms" << '\n';
	}
	else {
		just_do_it();
	}
}

int main() {
	set_up();
	just_exec_it();
	return 0;
}

// END BOILERPLATE CODE

// BEGIN MAIN CODE

const int ms = 1e5 + 20;
vector<int> adj[ms];
long long a[ms];
long long dp[ms];
int res = 0;
long long k;

void dfs(int u, int pr) {
	dp[u] = a[u];
	vector<long long> p;
	for (auto v: adj[u]) {
		if (v != pr) {
			dfs(v, u);
			p.push_back(dp[v]);
			res++;
		}
	}
	sort(p.begin(), p.end());
	for (auto x: p) {
		if (dp[u] + x <= k) {
			dp[u] += x;
			res--;
		}
	}
}

void just_do_it() {
	int n;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n - 1; i++) {
		int u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	dfs(1, -1);
	cout << res;
}

// END MAIN CODE

Compilation message

paprike.cpp: In function 'void file_io(std::string, std::string)':
paprike.cpp:25:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |   freopen(fi.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
paprike.cpp:28:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |   freopen(fo.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2584 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2676 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2676 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 2 ms 2676 KB Output is correct
20 Correct 2 ms 2684 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 42 ms 20304 KB Output is correct
2 Correct 44 ms 20300 KB Output is correct
3 Correct 43 ms 20308 KB Output is correct
4 Correct 47 ms 20304 KB Output is correct
5 Correct 40 ms 20168 KB Output is correct
6 Correct 41 ms 20176 KB Output is correct
7 Correct 41 ms 20168 KB Output is correct
8 Correct 38 ms 19660 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2584 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2676 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2676 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 2 ms 2676 KB Output is correct
20 Correct 2 ms 2684 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 3 ms 2772 KB Output is correct
23 Correct 2 ms 2688 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 2 ms 2872 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2692 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2696 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2692 KB Output is correct
35 Correct 3 ms 2644 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2584 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 1 ms 2644 KB Output is correct
12 Correct 2 ms 2676 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2676 KB Output is correct
18 Correct 2 ms 2772 KB Output is correct
19 Correct 2 ms 2676 KB Output is correct
20 Correct 2 ms 2684 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 42 ms 20304 KB Output is correct
23 Correct 44 ms 20300 KB Output is correct
24 Correct 43 ms 20308 KB Output is correct
25 Correct 47 ms 20304 KB Output is correct
26 Correct 40 ms 20168 KB Output is correct
27 Correct 41 ms 20176 KB Output is correct
28 Correct 41 ms 20168 KB Output is correct
29 Correct 38 ms 19660 KB Output is correct
30 Correct 3 ms 2772 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 2 ms 2644 KB Output is correct
33 Correct 2 ms 2872 KB Output is correct
34 Correct 2 ms 2644 KB Output is correct
35 Correct 2 ms 2692 KB Output is correct
36 Correct 2 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2644 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 2 ms 2696 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 2 ms 2692 KB Output is correct
43 Correct 3 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2644 KB Output is correct
47 Correct 47 ms 13296 KB Output is correct
48 Correct 42 ms 11480 KB Output is correct
49 Correct 44 ms 10808 KB Output is correct
50 Correct 41 ms 10492 KB Output is correct
51 Correct 54 ms 9428 KB Output is correct
52 Correct 47 ms 9432 KB Output is correct
53 Correct 45 ms 9268 KB Output is correct
54 Correct 46 ms 9284 KB Output is correct
55 Correct 44 ms 8884 KB Output is correct
56 Correct 43 ms 8876 KB Output is correct
57 Correct 30 ms 10320 KB Output is correct