oj.uz

Submission #967184

# Submission time Handle Problem Language Result Execution time Memory
967184 2024-04-21T12:54:52 Z mdobric Paprike (COI18_paprike) C++11
100 / 100
 41 ms 18816 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxn = 1e5 + 5;
int n, a[maxn], b[maxn], p[maxn];
long long h[maxn], k;
int dp[maxn];
long long ostatak[maxn];
vector <int> v[maxn];

void dfs (int x){
	for (int i = 0; i < v[x].size(); i++){
		if (p[x] != v[x][i]){
			p[v[x][i]] = x;
			dfs(v[x][i]);
		}
	}
}

int solve (int x){
	vector <long long> sve;
	for (int i = 0; i < v[x].size(); i++){
		if (p[x] != v[x][i]){
			solve(v[x][i]);
			dp[x] += dp[v[x][i]];
			sve.push_back(ostatak[v[x][i]]);
		}
	}
	sort(sve.begin(), sve.end());
	long long tr = h[x];
	for (int i = 0; i < sve.size(); i++){
		if (tr + sve[i] <= k){
			tr += sve[i];
		}
		else{
			dp[x]++;
		}
	}
	ostatak[x] = tr;
	//cout << x << " : " << dp[x] << " " << ostatak[x] << endl;
	//cout << sve.size() << endl << endl;
	return dp[x];
}

int main (void){
	
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin >> n >> k;
	for (int i = 1; i <= n; i++){
		cin >> h[i];
	}
	for (int i = 0; i < n - 1; i++){
		cin >> a[i] >> b[i];
		v[a[i]].push_back(b[i]);
		v[b[i]].push_back(a[i]);
	}
	dfs(1);
	cout << solve(1) << "\n";
	
	return 0;
}

Compilation message

paprike.cpp: In function 'void dfs(int)':
paprike.cpp:12:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |  for (int i = 0; i < v[x].size(); i++){
      |                  ~~^~~~~~~~~~~~~
paprike.cpp: In function 'int solve(int)':
paprike.cpp:22:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |  for (int i = 0; i < v[x].size(); i++){
      |                  ~~^~~~~~~~~~~~~
paprike.cpp:31:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for (int i = 0; i < sve.size(); i++){
      |                  ~~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 18772 KB Output is correct
2 Correct 38 ms 18772 KB Output is correct
3 Correct 35 ms 18768 KB Output is correct
4 Correct 34 ms 18768 KB Output is correct
5 Correct 41 ms 18768 KB Output is correct
6 Correct 37 ms 18816 KB Output is correct
7 Correct 35 ms 18672 KB Output is correct
8 Correct 33 ms 18288 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4744 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 1 ms 4708 KB Output is correct
5 Correct 2 ms 4696 KB Output is correct
6 Correct 1 ms 4696 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct
8 Correct 3 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4744 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 1 ms 4700 KB Output is correct
18 Correct 1 ms 4700 KB Output is correct
19 Correct 1 ms 4704 KB Output is correct
20 Correct 1 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Correct 37 ms 18772 KB Output is correct
23 Correct 38 ms 18772 KB Output is correct
24 Correct 35 ms 18768 KB Output is correct
25 Correct 34 ms 18768 KB Output is correct
26 Correct 41 ms 18768 KB Output is correct
27 Correct 37 ms 18816 KB Output is correct
28 Correct 35 ms 18672 KB Output is correct
29 Correct 33 ms 18288 KB Output is correct
30 Correct 1 ms 4696 KB Output is correct
31 Correct 2 ms 4888 KB Output is correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct
34 Correct 1 ms 4700 KB Output is correct
35 Correct 2 ms 4952 KB Output is correct
36 Correct 1 ms 4948 KB Output is correct
37 Correct 1 ms 4700 KB Output is correct
38 Correct 1 ms 4700 KB Output is correct
39 Correct 1 ms 4700 KB Output is correct
40 Correct 2 ms 4700 KB Output is correct
41 Correct 1 ms 4700 KB Output is correct
42 Correct 1 ms 4700 KB Output is correct
43 Correct 1 ms 4700 KB Output is correct
44 Correct 1 ms 4700 KB Output is correct
45 Correct 1 ms 4952 KB Output is correct
46 Correct 1 ms 4700 KB Output is correct
47 Correct 37 ms 13980 KB Output is correct
48 Correct 38 ms 13004 KB Output is correct
49 Correct 37 ms 12128 KB Output is correct
50 Correct 34 ms 11856 KB Output is correct
51 Correct 40 ms 11092 KB Output is correct
52 Correct 37 ms 11056 KB Output is correct
53 Correct 37 ms 10832 KB Output is correct
54 Correct 37 ms 10836 KB Output is correct
55 Correct 36 ms 10588 KB Output is correct
56 Correct 38 ms 10404 KB Output is correct
57 Correct 24 ms 12108 KB Output is correct