oj.uz

Submission #670833

# Submission time Handle Problem Language Result Execution time Memory
670833 2022-12-10T19:02:01 Z Arnch Beads and wires (APIO14_beads) C++17
100 / 100
 267 ms 29760 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define Sz(x) (x).size()
#define All(x) (x).begin(), (x).end()
 
const int N = 2e5 + 10;
const long long INF = 1e18;
 
long long dp[N][4];
vector<pair<int, int> > adj[N];
 
void DFS(int x, int p = 0, int cnt = 0) {
    for(auto [j, t] : adj[x]) {
        if(j == p) continue;
        DFS(j, x, t);
    }
    if(Sz(adj[x]) == 1 && x != 1) {
        return;
    }
	vector<long long> vc;
	long long sum = 0;
	for(auto [j, t] : adj[x]) {
		if(j == p) continue;
		sum += dp[j][1];
	}
	// ba babash
	long long mx = -INF, mx2 = -INF;
	for(auto [j, t] : adj[x]) {
		if(j == p) continue;
		mx = max(mx, max(dp[j][2], dp[j][3]) + t - dp[j][1]);
		mx2 = max(mx2, dp[j][3] + t - dp[j][1]);
	}
	dp[x][0] = max(dp[x][0], sum + mx + cnt);
	dp[x][1] = max(dp[x][1], sum + mx2 + cnt);
	// ba bachash
	long long ind = 0; mx = -INF;
	for(auto [j, t] : adj[x]) {
		if(j == p) continue;
		if((dp[j][2] - dp[j][1] + t >= mx) || ind == 0) {
			mx = dp[j][2] - dp[j][1] + t;
			ind = j;
		}
	}
	vc.clear();
	for(auto [j, t] : adj[x]) {
		if(j == ind || j == p) continue;
		vc.push_back(dp[j][3] + t - dp[j][1]);
	}
	sort(All(vc), greater<long long>());
	if(Sz(vc) > 0) {
		dp[x][0] = max(dp[x][0], sum + mx + vc[0]);
		dp[x][2] = max(dp[x][2], sum + mx + vc[0]);
	}
	if(Sz(vc) > 1) {
		dp[x][0] = max(dp[x][0], sum + vc[1] + vc[0]);
		dp[x][2] = max(dp[x][2], sum + vc[1] + vc[0]);
	}
	ind = 0; mx = -INF;
	for(auto [j, t] : adj[x]) {
		if(j == p) continue;
		if((dp[j][3] - dp[j][1] + t >= mx) || ind == 0) {
			mx = dp[j][3] - dp[j][1] + t;
			ind = j;
		}
	}
	vc.clear();
	for(auto [j, t] : adj[x]) {
		if(j == ind || j == p) continue;
		vc.push_back(dp[j][2] + t - dp[j][1]);
	}
	sort(All(vc), greater<long long>());
	if(Sz(vc) > 0) {
		dp[x][0] = max(dp[x][0], sum + mx + vc[0]);
		dp[x][2] = max(dp[x][2], sum + mx + vc[0]);
	}
	// hich kodom
	mx = -INF;
	for(auto [j, t] : adj[x]) {
		if(j == p) continue;
		mx = max(mx, dp[j][0] - dp[j][1]);
	}
	for(int i = 0; i < 4; i++) dp[x][i] = max(dp[x][i], sum);
	dp[x][0] = max(dp[x][0], sum + mx);
	dp[x][2] = max(dp[x][2], sum + mx);
}
 
int main() {
    int n; cin >>n;
    for(int i = 0; i < n - 1; i++) {
        int u, v, c; cin >>u >>v >>c;
        adj[u].push_back({v, c}), adj[v].push_back({u, c});
    }
 
    DFS(1);

	/*for(int i = 1; i <= n; i++) {
		cout<<"^^" <<i <<' ' <<dp[i][0] <<' ' <<dp[i][1] <<' ' <<dp[i][2] <<' ' <<dp[i][3] <<endl;
	}*/

	cout<<dp[1][2] <<endl;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 4 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5064 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 2 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 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 4 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5064 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 7 ms 5332 KB Output is correct
24 Correct 7 ms 5332 KB Output is correct
25 Correct 7 ms 5332 KB Output is correct
26 Correct 12 ms 5576 KB Output is correct
27 Correct 12 ms 5676 KB Output is correct
28 Correct 11 ms 5852 KB Output is correct
29 Correct 11 ms 5380 KB Output is correct
30 Correct 11 ms 5716 KB Output is correct
31 Correct 11 ms 6228 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 4 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 5064 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 7 ms 5332 KB Output is correct
24 Correct 7 ms 5332 KB Output is correct
25 Correct 7 ms 5332 KB Output is correct
26 Correct 12 ms 5576 KB Output is correct
27 Correct 12 ms 5676 KB Output is correct
28 Correct 11 ms 5852 KB Output is correct
29 Correct 11 ms 5380 KB Output is correct
30 Correct 11 ms 5716 KB Output is correct
31 Correct 11 ms 6228 KB Output is correct
32 Correct 49 ms 8420 KB Output is correct
33 Correct 51 ms 8352 KB Output is correct
34 Correct 49 ms 8420 KB Output is correct
35 Correct 267 ms 18664 KB Output is correct
36 Correct 258 ms 22236 KB Output is correct
37 Correct 261 ms 22220 KB Output is correct
38 Correct 217 ms 25648 KB Output is correct
39 Correct 230 ms 17952 KB Output is correct
40 Correct 214 ms 23512 KB Output is correct
41 Correct 251 ms 29760 KB Output is correct