oj.uz

Submission #706420

# Submission time Handle Problem Language Result Execution time Memory
706420 2023-03-06T14:30:37 Z mdobric Paprike (COI18_paprike) C++11
100 / 100
 121 ms 17476 KB 
#include <bits/stdc++.h>
using namespace std;

int n, k;
int h[100005];
int x[100005], y[100005];
vector <int> v[100005];
int zbr[100005];
int rez = 0;
int parent[100005];

void solve (int tr){
	vector <int> v2;
	for (int i = 0; i < v[tr].size(); i++){
		if (zbr[v[tr][i]] == -1){
			solve(v[tr][i]);
		}
		v2.push_back(zbr[v[tr][i]]);
	}
	sort(v2.begin(), v2.end());
	int suma = h[tr], ukp = 0;
	for (int i = 0; i < v2.size(); i++){
		if (suma + v2[i] <= k){
			suma = suma + v2[i];
			ukp++;
		}
		else{
			break;
		}
	}
	rez = rez + v2.size() - ukp;
	zbr[tr] = suma;
	//cout << tr << " " << rez << " " << zbr[tr] << endl;
	return;
}

int main (void){
	
	memset(zbr, -1, sizeof zbr);
	memset(parent, -1, sizeof parent);
	cin >> n >> k;
	for (int i = 1; i <= n; i++){
		cin >> h[i];
	}
	for (int i = 0; i < n - 1; i++){
		cin >> x[i] >> y[i];
		if (parent[x[i]] != -1){
			v[x[i]].push_back(y[i]);
			parent[y[i]] = 1;
		}
		else
		if (parent[y[i]] != -1){
			v[y[i]].push_back(x[i]);
			parent[x[i]] = 1;
		}
		else
		if (x[i] < y[i]){
			v[x[i]].push_back(y[i]);
			parent[y[i]] = 1;
		}
		else{
			v[y[i]].push_back(x[i]);
			parent[x[i]] = 1;
		}
	}
	for (int i = 1; i <= n; i++){
		if (v[i].size() == 0){
			zbr[i] = h[i];
		}
	}
	solve(1);
	cout << rez;
	
	return 0;
}

Compilation message

paprike.cpp: In function 'void solve(int)':
paprike.cpp:14:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for (int i = 0; i < v[tr].size(); i++){
      |                  ~~^~~~~~~~~~~~~~
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 < v2.size(); i++){
      |                  ~~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 17460 KB Output is correct
2 Correct 97 ms 17448 KB Output is correct
3 Correct 99 ms 17424 KB Output is correct
4 Correct 98 ms 17460 KB Output is correct
5 Correct 100 ms 17460 KB Output is correct
6 Correct 104 ms 17476 KB Output is correct
7 Correct 96 ms 17384 KB Output is correct
8 Correct 84 ms 16964 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3440 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3440 KB Output is correct
9 Correct 2 ms 3412 KB Output is correct
10 Correct 2 ms 3440 KB Output is correct
11 Correct 2 ms 3412 KB Output is correct
12 Correct 2 ms 3412 KB Output is correct
13 Correct 2 ms 3412 KB Output is correct
14 Correct 2 ms 3444 KB Output is correct
15 Correct 2 ms 3440 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 2 ms 3412 KB Output is correct
18 Correct 3 ms 3412 KB Output is correct
19 Correct 2 ms 3412 KB Output is correct
20 Correct 2 ms 3412 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 121 ms 17460 KB Output is correct
23 Correct 97 ms 17448 KB Output is correct
24 Correct 99 ms 17424 KB Output is correct
25 Correct 98 ms 17460 KB Output is correct
26 Correct 100 ms 17460 KB Output is correct
27 Correct 104 ms 17476 KB Output is correct
28 Correct 96 ms 17384 KB Output is correct
29 Correct 84 ms 16964 KB Output is correct
30 Correct 3 ms 3412 KB Output is correct
31 Correct 3 ms 3452 KB Output is correct
32 Correct 2 ms 3412 KB Output is correct
33 Correct 3 ms 3484 KB Output is correct
34 Correct 3 ms 3412 KB Output is correct
35 Correct 3 ms 3412 KB Output is correct
36 Correct 3 ms 3412 KB Output is correct
37 Correct 2 ms 3412 KB Output is correct
38 Correct 3 ms 3412 KB Output is correct
39 Correct 3 ms 3412 KB Output is correct
40 Correct 3 ms 3412 KB Output is correct
41 Correct 3 ms 3412 KB Output is correct
42 Correct 3 ms 3412 KB Output is correct
43 Correct 2 ms 3412 KB Output is correct
44 Correct 2 ms 3412 KB Output is correct
45 Correct 2 ms 3412 KB Output is correct
46 Correct 3 ms 3412 KB Output is correct
47 Correct 100 ms 11628 KB Output is correct
48 Correct 111 ms 10188 KB Output is correct
49 Correct 103 ms 9640 KB Output is correct
50 Correct 101 ms 9452 KB Output is correct
51 Correct 103 ms 8128 KB Output is correct
52 Correct 106 ms 8184 KB Output is correct
53 Correct 100 ms 8052 KB Output is correct
54 Correct 106 ms 8012 KB Output is correct
55 Correct 85 ms 7628 KB Output is correct
56 Correct 84 ms 7632 KB Output is correct
57 Correct 81 ms 7344 KB Output is correct