oj.uz

Submission #453264

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

using namespace std;

typedef long long ll;

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

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

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 dfs_up(int v, int p = -1, int pc = 0) {
	int sum = 0;
	multiset<int> st;
	if (p != -1) {
		sum += up[v][0];
		st.insert(up[v][0] - up[v][1] + pc);
	}
	for (auto [u, c] : g[v]) {
		if (u != p) {
			sum += dp[u][0];
			st.insert(dp[u][0] - dp[u][1] + c);
		}
	}
	for (auto [u, c] : g[v]) {
		if (u != p) {
			sum -= dp[u][0];
			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));
			dfs_up(u, v, c);
			sum += dp[u][0];
			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;
		ll c;
		cin >> a >> b >> c;
		g[a].push_back({b, c});
		g[b].push_back({a, c});
	}
	if (0) {
		dfs(1);
		dfs_up(1);
		int ans = 0;
		for (int i = 1; i <= n; ++i) {
			ans = max(ans, dp[i][0] + max(up[i][0], up[i][1]));
		}
		cout << ans << endl;
	} else {
		int ans = 0;
		for (int i = 1; i <= n; ++i) {
			dfs(i);
			ans = max(ans, dp[i][0]);
		}
		cout << ans << endl;
	}
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 612 ms 764 KB Output is correct
24 Correct 571 ms 772 KB Output is correct
25 Correct 605 ms 760 KB Output is correct
26 Execution timed out 1094 ms 972 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 2 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 612 ms 764 KB Output is correct
24 Correct 571 ms 772 KB Output is correct
25 Correct 605 ms 760 KB Output is correct
26 Execution timed out 1094 ms 972 KB Time limit exceeded
27 Halted 0 ms 0 KB -