oj.uz

Submission #704976

# Submission time Handle Problem Language Result Execution time Memory
704976 2023-03-03T07:31:17 Z pavement Beads and wires (APIO14_beads) C++17
100 / 100
 395 ms 40688 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
int n, mem[200005][2][2];
vector<ii> adj[200005];
int dp(int n, bool b, bool c, int e = -1) {
	if (mem[n][b][c] != -1) return mem[n][b][c];
	if (adj[n].size() - (e != -1) == 0) {
		// leaf node
		return b ? -(int)1e16 : 0;
	}
	int ret = -(int)1e16;
	if (c && !b) {
		int case_1 = 0, case_2 = -(int)1e16;
		vector<ii> reps, reps2;
		for (auto [u, w] : adj[n]) if (u != e) {
			int curr = max(dp(u, 0, 0, n), dp(u, 1, 0, n) + w);
			case_1 += curr;
			reps.eb(dp(u, 0, 1, n) + w - curr, u);
			reps2.eb(dp(u, 0, 0, n) + w - curr, u);
		}
		sort(reps.begin(), reps.end(), greater<ii>());
		sort(reps2.begin(), reps2.end(), greater<ii>());
		if (reps.size() > 3) reps.erase(reps.begin() + 3, reps.end());
		if (reps2.size() > 3) reps2.erase(reps2.begin() + 3, reps2.end());
		for (auto [v, idx] : reps) {
			for (auto [v2, idx2] : reps2) {
				if (idx != idx2) {
					case_2 = max(case_2, case_1 + v + v2);
				}
			}
		}
		ret = max({ret, case_1, case_2});
	}
	vector<ii> reps, reps2;
	int case_3 = 0, case_4 = -(int)1e16, case_5 = -(int)1e16;
	for (auto [u, w] : adj[n]) if (u != e) {
		int curr = max(dp(u, 0, 0, n), dp(u, 1, 0, n) + w);
		case_3 += curr;
		reps.eb(dp(u, 0, 0, n) + w - curr, u);
		reps2.eb(max(dp(u, 0, c, n), dp(u, 1, c, n) + w) - curr, u);
		case_5 = max(case_5, dp(u, 0, c, n) + w - curr);
	}
	sort(reps.begin(), reps.end(), greater<ii>());
	sort(reps2.begin(), reps2.end(), greater<ii>());
	if (reps.size() > 3) reps.erase(reps.begin() + 3, reps.end());
	if (reps2.size() > 3) reps2.erase(reps2.begin() + 3, reps2.end());
	if (b) {
		case_5 += case_3;
		ret = max(ret, case_5);
	} else {
		for (auto [v, idx] : reps2) {
			case_4 = max(case_4, case_3 + v);
		}
		ret = max(ret, case_4);
	}
	return mem[n][b][c] = ret;
}
main() {
	memset(mem, -1, sizeof mem);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1, u, v, w; i < n; i++) {
		cin >> u >> v >> w;
		adj[u].eb(v, w);
		adj[v].eb(u, w);
	}
	cout << dp(1, 0, 1) << '\n';
}

Compilation message

beads.cpp:80:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   80 | main() {
      | ^~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11220 KB Output is correct
2 Correct 6 ms 11220 KB Output is correct
3 Correct 5 ms 11220 KB Output is correct
4 Correct 5 ms 11220 KB Output is correct
5 Correct 5 ms 11220 KB Output is correct
6 Correct 5 ms 11220 KB Output is correct
7 Correct 6 ms 11220 KB Output is correct
8 Correct 6 ms 11288 KB Output is correct
9 Correct 5 ms 11292 KB Output is correct
10 Correct 5 ms 11220 KB Output is correct
11 Correct 6 ms 11220 KB Output is correct
12 Correct 6 ms 11288 KB Output is correct
13 Correct 6 ms 11220 KB Output is correct
14 Correct 6 ms 11292 KB Output is correct
15 Correct 5 ms 11292 KB Output is correct
16 Correct 6 ms 11292 KB Output is correct
17 Correct 6 ms 11220 KB Output is correct
18 Correct 6 ms 11288 KB Output is correct
19 Correct 6 ms 11220 KB Output is correct
20 Correct 6 ms 11348 KB Output is correct
21 Correct 6 ms 11220 KB Output is correct
22 Correct 6 ms 11288 KB Output is correct
23 Correct 10 ms 11556 KB Output is correct
24 Correct 10 ms 11552 KB Output is correct
25 Correct 10 ms 11560 KB Output is correct
26 Correct 15 ms 11940 KB Output is correct
27 Correct 15 ms 11936 KB Output is correct
28 Correct 19 ms 12544 KB Output is correct
29 Correct 18 ms 12184 KB Output is correct
30 Correct 19 ms 12216 KB Output is correct
31 Correct 16 ms 12992 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11220 KB Output is correct
2 Correct 6 ms 11220 KB Output is correct
3 Correct 5 ms 11220 KB Output is correct
4 Correct 5 ms 11220 KB Output is correct
5 Correct 5 ms 11220 KB Output is correct
6 Correct 5 ms 11220 KB Output is correct
7 Correct 6 ms 11220 KB Output is correct
8 Correct 6 ms 11288 KB Output is correct
9 Correct 5 ms 11292 KB Output is correct
10 Correct 5 ms 11220 KB Output is correct
11 Correct 6 ms 11220 KB Output is correct
12 Correct 6 ms 11288 KB Output is correct
13 Correct 6 ms 11220 KB Output is correct
14 Correct 6 ms 11292 KB Output is correct
15 Correct 5 ms 11292 KB Output is correct
16 Correct 6 ms 11292 KB Output is correct
17 Correct 6 ms 11220 KB Output is correct
18 Correct 6 ms 11288 KB Output is correct
19 Correct 6 ms 11220 KB Output is correct
20 Correct 6 ms 11348 KB Output is correct
21 Correct 6 ms 11220 KB Output is correct
22 Correct 6 ms 11288 KB Output is correct
23 Correct 10 ms 11556 KB Output is correct
24 Correct 10 ms 11552 KB Output is correct
25 Correct 10 ms 11560 KB Output is correct
26 Correct 15 ms 11940 KB Output is correct
27 Correct 15 ms 11936 KB Output is correct
28 Correct 19 ms 12544 KB Output is correct
29 Correct 18 ms 12184 KB Output is correct
30 Correct 19 ms 12216 KB Output is correct
31 Correct 16 ms 12992 KB Output is correct
32 Correct 63 ms 14612 KB Output is correct
33 Correct 55 ms 14620 KB Output is correct
34 Correct 58 ms 14580 KB Output is correct
35 Correct 279 ms 25040 KB Output is correct
36 Correct 281 ms 25060 KB Output is correct
37 Correct 275 ms 25036 KB Output is correct
38 Correct 395 ms 36016 KB Output is correct
39 Correct 387 ms 31332 KB Output is correct
40 Correct 386 ms 30464 KB Output is correct
41 Correct 373 ms 40688 KB Output is correct