oj.uz

Submission #261192

# Submission time Handle Problem Language Result Execution time Memory
261192 2020-08-11T13:53:18 Z atoiz Beads and wires (APIO14_beads) C++14
100 / 100
 322 ms 27632 KB 
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int MAXN = 200007;
const int64_t INF = 1e13;
int64_t dp[MAXN][2][2];
int N;
vector<pair<int, int>> G[MAXN];

void solve(int u, int p, int64_t c)
{
	dp[u][0][0] = dp[u][0][1] = -INF;
	dp[u][1][0] = dp[u][1][1] = -INF;

	int64_t a[2][2] = {{0, -INF}, {-INF, -INF}}; // --
	int64_t b[3] = {0, -INF, -INF}; // -0
	int64_t f[2] = {0, -INF};
	for (auto e : G[u]) {
		int v = e.first, w = e.second;
		if (v == p) continue;
		solve(v, u, w);

		a[1][1] = max(a[1][1] + dp[v][0][0], max(a[1][0] + dp[v][1][1], a[0][1] + dp[v][1][0]) + w);
		a[0][1] = max(a[0][1] + dp[v][0][0], a[0][0] + dp[v][1][1] + w);
		a[1][0] = max(a[1][0] + dp[v][0][0], a[0][0] + dp[v][1][0] + w);
		a[0][0] += dp[v][0][0];

		b[1] = max(b[1] + dp[v][0][0], b[0] + dp[v][1][0] + w);
		b[2] = max(b[2] + dp[v][0][0], b[0] + dp[v][1][1] + w);
		b[0] += dp[v][0][0];

		f[1] = max(f[0] + dp[v][0][1], f[1] + dp[v][0][0]);
		f[0] += dp[v][0][0];
	}

	dp[u][1][1] = max(dp[u][1][1], a[1][1]);
	dp[u][0][0] = max(dp[u][0][0], b[1] + c);
	dp[u][0][1] = max(dp[u][0][1], b[2] + c);

	dp[u][1][0] = max(dp[u][1][0], b[0]);
	dp[u][1][1] = max(dp[u][1][1], b[0]);
	dp[u][1][1] = max(dp[u][1][1], f[1]);

	dp[u][0][0] = max(dp[u][0][0], dp[u][1][0]);
	dp[u][0][1] = max(dp[u][0][1], dp[u][1][1]);

	// cout << u << ' ' << 0 << ' ' << 0 << ": " << dp[u][0][0] << endl;
	// cout << u << ' ' << 0 << ' ' << 1 << ": " << dp[u][0][1] << endl;
	// cout << u << ' ' << 1 << ' ' << 0 << ": " << dp[u][1][0] << endl;
	// cout << u << ' ' << 1 << ' ' << 1 << ": " << dp[u][1][1] << endl;
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N;
	for (int i = 0; i < N - 1; ++i) {
		int u, v, w;
		cin >> u >> v >> w;
		G[u].emplace_back(v, w);
		G[v].emplace_back(u, w);
	}
	solve(1, 0, -INF);
	cout << dp[1][0][1] << endl;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 5 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 5 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 5 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 4 ms 4992 KB Output is correct
17 Correct 4 ms 5120 KB Output is correct
18 Correct 5 ms 5024 KB Output is correct
19 Correct 4 ms 4992 KB Output is correct
20 Correct 4 ms 4992 KB Output is correct
21 Correct 5 ms 4992 KB Output is correct
22 Correct 5 ms 4992 KB Output is correct
23 Correct 7 ms 5504 KB Output is correct
24 Correct 8 ms 5504 KB Output is correct
25 Correct 7 ms 5504 KB Output is correct
26 Correct 10 ms 5888 KB Output is correct
27 Correct 12 ms 5888 KB Output is correct
28 Correct 10 ms 5884 KB Output is correct
29 Correct 10 ms 5880 KB Output is correct
30 Correct 10 ms 5816 KB Output is correct
31 Correct 11 ms 6392 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 5 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 5120 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 5 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 5 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 4 ms 4992 KB Output is correct
17 Correct 4 ms 5120 KB Output is correct
18 Correct 5 ms 5024 KB Output is correct
19 Correct 4 ms 4992 KB Output is correct
20 Correct 4 ms 4992 KB Output is correct
21 Correct 5 ms 4992 KB Output is correct
22 Correct 5 ms 4992 KB Output is correct
23 Correct 7 ms 5504 KB Output is correct
24 Correct 8 ms 5504 KB Output is correct
25 Correct 7 ms 5504 KB Output is correct
26 Correct 10 ms 5888 KB Output is correct
27 Correct 12 ms 5888 KB Output is correct
28 Correct 10 ms 5884 KB Output is correct
29 Correct 10 ms 5880 KB Output is correct
30 Correct 10 ms 5816 KB Output is correct
31 Correct 11 ms 6392 KB Output is correct
32 Correct 43 ms 9320 KB Output is correct
33 Correct 43 ms 9324 KB Output is correct
34 Correct 39 ms 9208 KB Output is correct
35 Correct 265 ms 22324 KB Output is correct
36 Correct 264 ms 22264 KB Output is correct
37 Correct 322 ms 22264 KB Output is correct
38 Correct 197 ms 22632 KB Output is correct
39 Correct 195 ms 22616 KB Output is correct
40 Correct 195 ms 22624 KB Output is correct
41 Correct 264 ms 27632 KB Output is correct