oj.uz

Submission #675488

# Submission time Handle Problem Language Result Execution time Memory
675488 2022-12-27T10:42:46 Z AmirAli_H1 Beads and wires (APIO14_beads) C++17
100 / 100
 195 ms 40848 KB 
// In the name of Allah

#include <bits/stdc++.h>
using namespace std;

typedef long long int	ll;
typedef long double	ld;
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pll;

#define all(x)		(x).begin(),(x).end()
#define len(x)		((ll) (x).size())
#define F		first
#define S		second
#define pb		push_back
#define sep             ' '
#define endl            '\n'
#define Mp		make_pair
#define debug(x)	cerr << #x << ": " <<  x << endl;
#define kill(x)		cout << x << '\n', exit(0);
#define set_dec(x)	cout << fixed << setprecision(x);
#define file_io(x,y)	freopen(x, "r", stdin); freopen(y, "w", stdout);

int n;
const int maxn = 2e5 + 5;
const ll oo = 1e14;
vector<pll> adj[maxn];
ll dp[maxn][2][2];
bool mark[maxn];

void dfs(int v, ll x = -1) {
	mark[v] = 1;
	ll res = 0;
	vector<pll> ls1, ls2, ls3;
	for (auto f : adj[v]) {
		auto [u, w] = f;
		if (!mark[u]) {
			dfs(u, w);
			
			res += dp[u][1][0];
			
			ls1.pb(Mp(w + dp[u][0][0] - dp[u][1][0], u));
			ls2.pb(Mp(w + dp[u][0][1] - dp[u][1][0], u));
			ls3.pb(Mp(dp[u][1][1] - dp[u][1][0], u));
		}
	}
	
	sort(all(ls1), greater<pll>()); sort(all(ls2), greater<pll>()); sort(all(ls3), greater<pll>());
	
	if (x == -1 || len(ls1) < 1) {
		dp[v][1][0] = -oo;
		dp[v][1][1] = -oo;
	}
	else {
		dp[v][1][0] = max(-oo, res + x + ls1[0].F);
		dp[v][1][1] = max(-oo, res + x + ls2[0].F);
	}
	
	dp[v][0][0] = res;
	if (len(ls3) < 1) dp[v][0][1] = -oo;
	else dp[v][0][1] = max(-oo, res + ls3[0].F);
	
	if (len(ls1) >= 2) {
		dp[v][0][1] = max(dp[v][0][1], res + ls1[0].F + ls1[1].F);
		if (ls1[0].S != ls2[0].S) {
			dp[v][0][1] = max(dp[v][0][1], res + ls1[0].F + ls2[0].F);
		}
		else {
			dp[v][0][1] = max(dp[v][0][1], res + ls1[0].F + ls2[1].F);
			dp[v][0][1] = max(dp[v][0][1], res + ls1[1].F + ls2[0].F);
		}
	}
	
	dp[v][1][0] = max(dp[v][1][0], dp[v][0][0]);
	dp[v][1][1] = max(dp[v][1][1], dp[v][0][1]);
	
	ls1.clear(); ls1.shrink_to_fit();
	ls2.clear(); ls2.shrink_to_fit();
	ls3.clear(); ls3.shrink_to_fit();
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	cin >> n;
	for (int i = 0; i < n - 1; i++) {
		int u, v; ll w;
		cin >> u >> v >> w; u--; v--;
		adj[u].pb(Mp(v, w)); adj[v].pb(Mp(u, w));
	}
	
	dfs(0);
	
	cout << max(dp[0][0][0], dp[0][0][1]) << endl;
	
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 4920 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 5024 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 5024 KB Output is correct
11 Correct 3 ms 5020 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 4920 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 5024 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 5024 KB Output is correct
11 Correct 3 ms 5020 KB Output is correct
12 Correct 3 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 4948 KB Output is correct
16 Correct 3 ms 4948 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 2 ms 4948 KB Output is correct
21 Correct 3 ms 4948 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 3 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 4920 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 5024 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 5024 KB Output is correct
11 Correct 3 ms 5020 KB Output is correct
12 Correct 3 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 4948 KB Output is correct
16 Correct 3 ms 4948 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 2 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 5 ms 5424 KB Output is correct
24 Correct 5 ms 5460 KB Output is correct
25 Correct 5 ms 5416 KB Output is correct
26 Correct 8 ms 5940 KB Output is correct
27 Correct 8 ms 5972 KB Output is correct
28 Correct 9 ms 6736 KB Output is correct
29 Correct 9 ms 6444 KB Output is correct
30 Correct 10 ms 6372 KB Output is correct
31 Correct 8 ms 7124 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 4920 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 5024 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 5024 KB Output is correct
11 Correct 3 ms 5020 KB Output is correct
12 Correct 3 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 4948 KB Output is correct
16 Correct 3 ms 4948 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 2 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 5 ms 5424 KB Output is correct
24 Correct 5 ms 5460 KB Output is correct
25 Correct 5 ms 5416 KB Output is correct
26 Correct 8 ms 5940 KB Output is correct
27 Correct 8 ms 5972 KB Output is correct
28 Correct 9 ms 6736 KB Output is correct
29 Correct 9 ms 6444 KB Output is correct
30 Correct 10 ms 6372 KB Output is correct
31 Correct 8 ms 7124 KB Output is correct
32 Correct 31 ms 9916 KB Output is correct
33 Correct 31 ms 9908 KB Output is correct
34 Correct 34 ms 9968 KB Output is correct
35 Correct 181 ms 25140 KB Output is correct
36 Correct 179 ms 25288 KB Output is correct
37 Correct 178 ms 25212 KB Output is correct
38 Correct 171 ms 37488 KB Output is correct
39 Correct 162 ms 34964 KB Output is correct
40 Correct 161 ms 31684 KB Output is correct
41 Correct 195 ms 40848 KB Output is correct