oj.uz

Submission #144807

# Submission time Handle Problem Language Result Execution time Memory
144807 2019-08-17T20:10:47 Z emilem Paprike (COI18_paprike) C++14
100 / 100
 214 ms 18536 KB 
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int n, k;
vector<int> h, toLeaf;
vector< vector<int> > nei;
vector<int> ans, val;

void Dfs(int v, int par)
{
	vector<int> vals;
	val[v] = h[v];
	for (int i = 0; i < nei[v].size(); ++i)
	{
		int to = nei[v][i];
		if (to == par) continue;
		Dfs(to, v);
		ans[v] += ans[to];
		vals.push_back(val[to]);
	}
	sort(vals.begin(), vals.end());
	ans[v] += vals.size();
	for (int i = 0; i < vals.size(); ++i)
		if (val[v] + vals[i] <= k)
		{
			val[v] += vals[i];
			--ans[v];
		}
}
int main()
{
	cin >> n >> k;
	h.resize(n + 1); nei.resize(n + 1); ans.resize(n + 1); val.resize(n + 1);
	for (int i = 1; i <= n; ++i)
		cin >> h[i];
	for (int i = 1; i < n; ++i)
	{
		int u, v;
		cin >> u >> v;
		nei[u].push_back(v);
		nei[v].push_back(u);
	}
	Dfs(1, -1);
	cout << ans[1] << endl;

	char I;
	cin >> I;
}

Compilation message

paprike.cpp: In function 'void Dfs(int, int)':
paprike.cpp:15:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < nei[v].size(); ++i)
                  ~~^~~~~~~~~~~~~~~
paprike.cpp:25:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < vals.size(); ++i)
                  ~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 18380 KB Output is correct
2 Correct 197 ms 18536 KB Output is correct
3 Correct 197 ms 18424 KB Output is correct
4 Correct 197 ms 18424 KB Output is correct
5 Correct 193 ms 18272 KB Output is correct
6 Correct 214 ms 18248 KB Output is correct
7 Correct 193 ms 18296 KB Output is correct
8 Correct 163 ms 17760 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 268 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 392 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 199 ms 18380 KB Output is correct
23 Correct 197 ms 18536 KB Output is correct
24 Correct 197 ms 18424 KB Output is correct
25 Correct 197 ms 18424 KB Output is correct
26 Correct 193 ms 18272 KB Output is correct
27 Correct 214 ms 18248 KB Output is correct
28 Correct 193 ms 18296 KB Output is correct
29 Correct 163 ms 17760 KB Output is correct
30 Correct 4 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 4 ms 376 KB Output is correct
33 Correct 4 ms 376 KB Output is correct
34 Correct 4 ms 376 KB Output is correct
35 Correct 4 ms 376 KB Output is correct
36 Correct 4 ms 376 KB Output is correct
37 Correct 4 ms 380 KB Output is correct
38 Correct 4 ms 376 KB Output is correct
39 Correct 4 ms 376 KB Output is correct
40 Correct 4 ms 376 KB Output is correct
41 Correct 18 ms 376 KB Output is correct
42 Correct 4 ms 376 KB Output is correct
43 Correct 4 ms 376 KB Output is correct
44 Correct 4 ms 376 KB Output is correct
45 Correct 4 ms 376 KB Output is correct
46 Correct 4 ms 376 KB Output is correct
47 Correct 198 ms 12556 KB Output is correct
48 Correct 203 ms 10876 KB Output is correct
49 Correct 196 ms 10360 KB Output is correct
50 Correct 200 ms 10104 KB Output is correct
51 Correct 206 ms 9012 KB Output is correct
52 Correct 210 ms 9000 KB Output is correct
53 Correct 205 ms 9124 KB Output is correct
54 Correct 210 ms 9080 KB Output is correct
55 Correct 187 ms 8540 KB Output is correct
56 Correct 179 ms 8568 KB Output is correct
57 Correct 163 ms 9840 KB Output is correct