oj.uz

Submission #869768

# Submission time Handle Problem Language Result Execution time Memory
869768 2023-11-05T15:14:11 Z serifefedartar Power Plant (JOI20_power) C++17
100 / 100
 111 ms 30212 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9+9;
const ll LOGN = 30; 
const ll MAXN = 2e5 + 100;
const ll MULT = 1e9;

vector<vector<int>> graph;
int here[MAXN], sub[MAXN], par[MAXN];
int ans = 0;

void dfs(int node, int parent) {
	int sum = 0;
	for (auto u : graph[node]) {
		if (u == parent)
			continue;
		dfs(u, node);
		sum += sub[u];
	}
	sub[node] = max(here[node], sum - here[node]);
}

void dfs2(int node, int parent) {
	int sum = 0;
	for (auto u : graph[node]) {
		if (u != parent)
			sum += sub[u];
	}
	sum += par[node];

	for (auto u : graph[node]) {
		if (u != parent)
			par[u] = max(here[node], sum - sub[u] - here[node]);
	}

	for (auto u : graph[node]) {
		if (u == parent)
			continue;
		dfs2(u, node);
	}
}

int main() {
	fast
	int N, A, B;
	cin >> N;

	graph = vector<vector<int>>(N+1, vector<int>());
	for (int i = 1; i < N; i++) {
		cin >> A >> B;
		graph[A].push_back(B);
		graph[B].push_back(A);
	}
	for (int i = 1; i <= N; i++) {
		char ch; cin >> ch;
		here[i] = ch - '0';
	}
	dfs(1, 1);
	dfs2(1, -1);

	for (int i = 1; i <= N; i++)
		ans = max(ans, sub[i] + par[i]);
	cout << ans << "\n";
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2516 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2512 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2532 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 2524 KB Output is correct
29 Correct 1 ms 2632 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2640 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2392 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 1 ms 2652 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Correct 1 ms 2524 KB Output is correct
41 Correct 1 ms 2652 KB Output is correct
42 Correct 1 ms 2652 KB Output is correct
43 Correct 1 ms 2652 KB Output is correct
44 Correct 1 ms 2652 KB Output is correct
45 Correct 1 ms 2652 KB Output is correct
46 Correct 1 ms 2652 KB Output is correct
47 Correct 1 ms 2652 KB Output is correct
48 Correct 1 ms 2652 KB Output is correct
49 Correct 1 ms 2652 KB Output is correct
50 Correct 1 ms 2504 KB Output is correct
51 Correct 1 ms 2652 KB Output is correct
52 Correct 1 ms 2644 KB Output is correct
53 Correct 1 ms 2652 KB Output is correct
54 Correct 1 ms 2652 KB Output is correct
55 Correct 1 ms 2652 KB Output is correct
56 Correct 1 ms 2648 KB Output is correct
57 Correct 1 ms 2648 KB Output is correct
58 Correct 1 ms 2652 KB Output is correct
59 Correct 1 ms 2652 KB Output is correct
60 Correct 1 ms 2648 KB Output is correct
61 Correct 1 ms 2652 KB Output is correct
62 Correct 1 ms 2652 KB Output is correct
63 Correct 1 ms 2520 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2516 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2512 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2652 KB Output is correct
23 Correct 1 ms 2652 KB Output is correct
24 Correct 1 ms 2532 KB Output is correct
25 Correct 1 ms 2652 KB Output is correct
26 Correct 1 ms 2652 KB Output is correct
27 Correct 1 ms 2652 KB Output is correct
28 Correct 1 ms 2524 KB Output is correct
29 Correct 1 ms 2632 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2640 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2392 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 1 ms 2652 KB Output is correct
39 Correct 1 ms 2652 KB Output is correct
40 Correct 1 ms 2524 KB Output is correct
41 Correct 1 ms 2652 KB Output is correct
42 Correct 1 ms 2652 KB Output is correct
43 Correct 1 ms 2652 KB Output is correct
44 Correct 1 ms 2652 KB Output is correct
45 Correct 1 ms 2652 KB Output is correct
46 Correct 1 ms 2652 KB Output is correct
47 Correct 1 ms 2652 KB Output is correct
48 Correct 1 ms 2652 KB Output is correct
49 Correct 1 ms 2652 KB Output is correct
50 Correct 1 ms 2504 KB Output is correct
51 Correct 1 ms 2652 KB Output is correct
52 Correct 1 ms 2644 KB Output is correct
53 Correct 1 ms 2652 KB Output is correct
54 Correct 1 ms 2652 KB Output is correct
55 Correct 1 ms 2652 KB Output is correct
56 Correct 1 ms 2648 KB Output is correct
57 Correct 1 ms 2648 KB Output is correct
58 Correct 1 ms 2652 KB Output is correct
59 Correct 1 ms 2652 KB Output is correct
60 Correct 1 ms 2648 KB Output is correct
61 Correct 1 ms 2652 KB Output is correct
62 Correct 1 ms 2652 KB Output is correct
63 Correct 1 ms 2520 KB Output is correct
64 Correct 96 ms 16560 KB Output is correct
65 Correct 73 ms 16364 KB Output is correct
66 Correct 96 ms 16408 KB Output is correct
67 Correct 107 ms 16396 KB Output is correct
68 Correct 94 ms 16828 KB Output is correct
69 Correct 70 ms 16396 KB Output is correct
70 Correct 87 ms 16520 KB Output is correct
71 Correct 76 ms 16408 KB Output is correct
72 Correct 82 ms 16500 KB Output is correct
73 Correct 108 ms 29008 KB Output is correct
74 Correct 109 ms 29008 KB Output is correct
75 Correct 64 ms 16464 KB Output is correct
76 Correct 66 ms 16464 KB Output is correct
77 Correct 80 ms 16464 KB Output is correct
78 Correct 76 ms 16468 KB Output is correct
79 Correct 69 ms 16212 KB Output is correct
80 Correct 74 ms 16212 KB Output is correct
81 Correct 63 ms 16652 KB Output is correct
82 Correct 71 ms 16588 KB Output is correct
83 Correct 92 ms 21484 KB Output is correct
84 Correct 90 ms 23796 KB Output is correct
85 Correct 92 ms 23272 KB Output is correct
86 Correct 96 ms 17748 KB Output is correct
87 Correct 76 ms 17236 KB Output is correct
88 Correct 78 ms 17748 KB Output is correct
89 Correct 77 ms 17748 KB Output is correct
90 Correct 92 ms 17532 KB Output is correct
91 Correct 75 ms 17748 KB Output is correct
92 Correct 77 ms 18000 KB Output is correct
93 Correct 74 ms 20432 KB Output is correct
94 Correct 79 ms 22172 KB Output is correct
95 Correct 85 ms 20956 KB Output is correct
96 Correct 75 ms 19156 KB Output is correct
97 Correct 69 ms 17588 KB Output is correct
98 Correct 68 ms 16980 KB Output is correct
99 Correct 84 ms 16748 KB Output is correct
100 Correct 93 ms 20308 KB Output is correct
101 Correct 82 ms 17860 KB Output is correct
102 Correct 74 ms 17188 KB Output is correct
103 Correct 77 ms 17108 KB Output is correct
104 Correct 60 ms 17328 KB Output is correct
105 Correct 110 ms 25856 KB Output is correct
106 Correct 46 ms 17096 KB Output is correct
107 Correct 49 ms 16980 KB Output is correct
108 Correct 109 ms 29776 KB Output is correct
109 Correct 44 ms 17356 KB Output is correct
110 Correct 111 ms 30212 KB Output is correct
111 Correct 66 ms 16464 KB Output is correct