Submission #453265

# Submission time Handle Problem Language Result Execution time Memory
453265 2021-08-04T10:18:21 Z valerikk Beads and wires (APIO14_beads) C++17
100 / 100
412 ms 33416 KB
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

typedef long long ll;

const int N = 200010;
const int INF = 2e9;

int n;
vector<pair<int, int>> g[N];
int dp[N][2];
int up[N][2];
int ans = 0;

void dfs(int v, int p = -1, int pc = 0) {
	int mx = -INF, sum = 0;
	for (auto [u, c] : g[v]) {
		if (u != p) {
			dfs(u, v, c);
			sum += dp[u][1];
			mx = max(mx, dp[u][0] - dp[u][1] + c);
		}
	}
	dp[v][0] = sum;
	dp[v][1] = sum + max(0, mx + pc);
}

void go(int v, int p = -1, int pc = 0) {
	int sum = 0;
	multiset<int> st;
	if (p != -1) {
		sum += up[v][1];
		st.insert(up[v][0] - up[v][1] + pc);
	}
	for (auto [u, c] : g[v]) {
		if (u != p) {
			sum += dp[u][1];
			st.insert(dp[u][0] - dp[u][1] + c);
		}
	}
	ans = max(ans, sum);
	for (auto [u, c] : g[v]) {
		if (u != p) {
			sum -= dp[u][1];
			st.erase(st.find(dp[u][0] - dp[u][1] + c));
			up[u][0] = sum;
			up[u][1] = sum + (st.empty() ? 0 : max(0, *st.rbegin() + c));
			go(u, v, c);
			sum += dp[u][1];
			st.insert(dp[u][0] - dp[u][1] + c);
		}
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for (int i = 0; i < n - 1; ++i) {
		int a, b, c;
		cin >> a >> b >> c;
		g[a].push_back({b, c});
		g[b].push_back({a, c});
	}
	dfs(1);
	go(1);
	cout << ans << endl;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 4 ms 4940 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 4 ms 4940 KB Output is correct
23 Correct 7 ms 5196 KB Output is correct
24 Correct 7 ms 5196 KB Output is correct
25 Correct 7 ms 5180 KB Output is correct
26 Correct 10 ms 5476 KB Output is correct
27 Correct 11 ms 5708 KB Output is correct
28 Correct 13 ms 6092 KB Output is correct
29 Correct 16 ms 6092 KB Output is correct
30 Correct 13 ms 5992 KB Output is correct
31 Correct 12 ms 6732 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 4 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 4 ms 4940 KB Output is correct
23 Correct 7 ms 5196 KB Output is correct
24 Correct 7 ms 5196 KB Output is correct
25 Correct 7 ms 5180 KB Output is correct
26 Correct 10 ms 5476 KB Output is correct
27 Correct 11 ms 5708 KB Output is correct
28 Correct 13 ms 6092 KB Output is correct
29 Correct 16 ms 6092 KB Output is correct
30 Correct 13 ms 5992 KB Output is correct
31 Correct 12 ms 6732 KB Output is correct
32 Correct 46 ms 8388 KB Output is correct
33 Correct 42 ms 8424 KB Output is correct
34 Correct 42 ms 8328 KB Output is correct
35 Correct 289 ms 19208 KB Output is correct
36 Correct 275 ms 19132 KB Output is correct
37 Correct 273 ms 19164 KB Output is correct
38 Correct 412 ms 28020 KB Output is correct
39 Correct 370 ms 28908 KB Output is correct
40 Correct 366 ms 27892 KB Output is correct
41 Correct 359 ms 33416 KB Output is correct