oj.uz

Submission #650253

# Submission time Handle Problem Language Result Execution time Memory
650253 2022-10-13T08:55:23 Z ymm Beads and wires (APIO14_beads) C++17
100 / 100
 224 ms 28692 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

const int N = 200'010;
vector<pii> A[N];
int n;

array<int, 4> dfs(int v, int p, int w)
{
	int sum0 = 0;
	vector<pii> v20, v10w, v30w;
	for (auto [u, e] : A[v]) {
		if (u == p)
			continue;
		auto x = dfs(u, v, e);
		v20.emplace_back(x[2] - x[0], u);
		v10w.emplace_back(x[1] - x[0] + e, u);
		v30w.emplace_back(x[3] - x[0] + e, u);
		sum0 += x[0];
	}
	v20.push_back({-1e9, -1}); v20.push_back({-1e9, -2});
	v10w.push_back({-1e9, -3}); v10w.push_back({-1e9, -4});
	v30w.push_back({-1e9, -5}); v30w.push_back({-1e9, -6});
	sort(v20.rbegin(), v20.rend());
	sort(v10w.rbegin(), v10w.rend());
	sort(v30w.rbegin(), v30w.rend());
	array<int, 4> ans = {};
	ans[0] = sum0 + v10w[0].first + w;
	ans[1] = 0;
	if (v30w[0].second != v10w[0].second) {
		ans[3] = sum0 + v30w[0].first + v10w[0].first;
	} else {
		ans[3] = sum0 + max(v30w[0].first + v10w[1].first,
		                    v30w[1].first + v10w[0].first);
	}
	ans[2] = max(ans[3], sum0 + v30w[0].first + w);
	ans[0] = max(ans[0], sum0);
	ans[1] = max(ans[1], sum0);
	ans[2] = max(ans[2], sum0 + v20[0].first);
	ans[3] = max(ans[3], sum0 + v20[0].first);
	Loop (i,0,4)
		ans[i] = max(ans[i], 0);
	return ans;
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cin >> n;
	Loop (i,1,n) {
		int v, u, w;
		cin >> v >> u >> w;
		--v; --u;
		A[v].push_back({u, w});
		A[u].push_back({v, w});
	}
	cout << dfs(0, -1, 0)[3] << '\n';
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 4 ms 5016 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4912 KB Output is correct
16 Correct 3 ms 5020 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4992 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 7 ms 5204 KB Output is correct
24 Correct 7 ms 5156 KB Output is correct
25 Correct 7 ms 5304 KB Output is correct
26 Correct 9 ms 5544 KB Output is correct
27 Correct 10 ms 5544 KB Output is correct
28 Correct 14 ms 5928 KB Output is correct
29 Correct 11 ms 5804 KB Output is correct
30 Correct 11 ms 5760 KB Output is correct
31 Correct 11 ms 6484 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 4 ms 5016 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 4 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4912 KB Output is correct
16 Correct 3 ms 5020 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4992 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 7 ms 5204 KB Output is correct
24 Correct 7 ms 5156 KB Output is correct
25 Correct 7 ms 5304 KB Output is correct
26 Correct 9 ms 5544 KB Output is correct
27 Correct 10 ms 5544 KB Output is correct
28 Correct 14 ms 5928 KB Output is correct
29 Correct 11 ms 5804 KB Output is correct
30 Correct 11 ms 5760 KB Output is correct
31 Correct 11 ms 6484 KB Output is correct
32 Correct 45 ms 7548 KB Output is correct
33 Correct 41 ms 7648 KB Output is correct
34 Correct 41 ms 7584 KB Output is correct
35 Correct 224 ms 16108 KB Output is correct
36 Correct 181 ms 15996 KB Output is correct
37 Correct 196 ms 16016 KB Output is correct
38 Correct 211 ms 22960 KB Output is correct
39 Correct 192 ms 21676 KB Output is correct
40 Correct 193 ms 20172 KB Output is correct
41 Correct 216 ms 28692 KB Output is correct