oj.uz

답안 #44605

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
44605 2018-04-03T20:54:41 Z ulna Paprike (COI18_paprike) C++11
38 / 100
 1000 ms 16808 KB 
#include <bits/stdc++.h>
using namespace std;

// why am I so weak

int n, k;
int a[100055];
long long dp[100055];

vector<int> g[100055];

int dfs(int v, int par = -1) {
	dp[v] = a[v];
	int res = 0;

	for (auto u : g[v]) if (u != par) {
		res += dfs(u, v);
		dp[v] += dp[u];
	}

	sort(g[v].begin(), g[v].end(), [&] (int u, int v) {
		return dp[u] > dp[v];
	});

	for (auto u : g[v]) if (u != par) {
		if (dp[v] <= k) break;

		res++;
		dp[v] -= dp[u];
	}
	
	return res;
}
int main() {
	cin >> n >> k;

	for (int i = 0; i < n; i++) scanf("%d", &a[i]);

	for (int i = 0; i + 1 < n; i++) {
		int x, y;
		scanf("%d %d", &x, &y);
		x--, y--;

		g[x].push_back(y);
		g[y].push_back(x);
	}

	int res = INT_MAX;

	for (int i = 0; i < n; i++) {
		res = min(res, dfs(i));
	}

	printf("%d\n", res);

	return 0;
}

Compilation message

paprike.cpp: In function 'int main()':
paprike.cpp:37:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
                              ~~~~~^~~~~~~~~~~~~
paprike.cpp:41:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &x, &y);
   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2680 KB Output is correct
2 Correct 4 ms 2792 KB Output is correct
3 Correct 3 ms 2864 KB Output is correct
4 Correct 3 ms 2864 KB Output is correct
5 Correct 3 ms 2864 KB Output is correct
6 Correct 4 ms 2888 KB Output is correct
7 Correct 4 ms 2892 KB Output is correct
8 Correct 3 ms 3024 KB Output is correct
9 Correct 3 ms 3024 KB Output is correct
10 Correct 4 ms 3024 KB Output is correct
11 Correct 4 ms 3076 KB Output is correct
12 Correct 3 ms 3076 KB Output is correct
13 Correct 3 ms 3076 KB Output is correct
14 Correct 4 ms 3076 KB Output is correct
15 Correct 3 ms 3160 KB Output is correct
16 Correct 4 ms 3160 KB Output is correct
17 Correct 4 ms 3208 KB Output is correct
18 Correct 4 ms 3208 KB Output is correct
19 Correct 4 ms 3312 KB Output is correct
20 Correct 4 ms 3312 KB Output is correct
21 Correct 4 ms 3312 KB Output is correct

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1077 ms 16808 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2680 KB Output is correct
2 Correct 4 ms 2792 KB Output is correct
3 Correct 3 ms 2864 KB Output is correct
4 Correct 3 ms 2864 KB Output is correct
5 Correct 3 ms 2864 KB Output is correct
6 Correct 4 ms 2888 KB Output is correct
7 Correct 4 ms 2892 KB Output is correct
8 Correct 3 ms 3024 KB Output is correct
9 Correct 3 ms 3024 KB Output is correct
10 Correct 4 ms 3024 KB Output is correct
11 Correct 4 ms 3076 KB Output is correct
12 Correct 3 ms 3076 KB Output is correct
13 Correct 3 ms 3076 KB Output is correct
14 Correct 4 ms 3076 KB Output is correct
15 Correct 3 ms 3160 KB Output is correct
16 Correct 4 ms 3160 KB Output is correct
17 Correct 4 ms 3208 KB Output is correct
18 Correct 4 ms 3208 KB Output is correct
19 Correct 4 ms 3312 KB Output is correct
20 Correct 4 ms 3312 KB Output is correct
21 Correct 4 ms 3312 KB Output is correct
22 Correct 37 ms 16808 KB Output is correct
23 Correct 39 ms 16808 KB Output is correct
24 Correct 40 ms 16808 KB Output is correct
25 Correct 43 ms 16808 KB Output is correct
26 Correct 42 ms 16808 KB Output is correct
27 Correct 44 ms 16808 KB Output is correct
28 Correct 39 ms 16808 KB Output is correct
29 Correct 38 ms 16808 KB Output is correct
30 Correct 40 ms 16808 KB Output is correct
31 Correct 37 ms 16808 KB Output is correct
32 Correct 38 ms 16808 KB Output is correct
33 Correct 36 ms 16808 KB Output is correct
34 Correct 39 ms 16808 KB Output is correct
35 Correct 39 ms 16808 KB Output is correct
36 Correct 39 ms 16808 KB Output is correct
37 Correct 38 ms 16808 KB Output is correct
38 Correct 44 ms 16808 KB Output is correct

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2680 KB Output is correct
2 Correct 4 ms 2792 KB Output is correct
3 Correct 3 ms 2864 KB Output is correct
4 Correct 3 ms 2864 KB Output is correct
5 Correct 3 ms 2864 KB Output is correct
6 Correct 4 ms 2888 KB Output is correct
7 Correct 4 ms 2892 KB Output is correct
8 Correct 3 ms 3024 KB Output is correct
9 Correct 3 ms 3024 KB Output is correct
10 Correct 4 ms 3024 KB Output is correct
11 Correct 4 ms 3076 KB Output is correct
12 Correct 3 ms 3076 KB Output is correct
13 Correct 3 ms 3076 KB Output is correct
14 Correct 4 ms 3076 KB Output is correct
15 Correct 3 ms 3160 KB Output is correct
16 Correct 4 ms 3160 KB Output is correct
17 Correct 4 ms 3208 KB Output is correct
18 Correct 4 ms 3208 KB Output is correct
19 Correct 4 ms 3312 KB Output is correct
20 Correct 4 ms 3312 KB Output is correct
21 Correct 4 ms 3312 KB Output is correct
22 Execution timed out 1077 ms 16808 KB Time limit exceeded
23 Halted 0 ms 0 KB -