oj.uz

Submission #670832

# Submission time Handle Problem Language Result Execution time Memory
670832 2022-12-10T19:01:22 Z Arnch Beads and wires (APIO14_beads) C++17
57 / 100
 211 ms 28568 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define Sz(x) (x).size()
#define All(x) (x).begin(), (x).end()
 
const int N = 1e5 + 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 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2664 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2660 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2664 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2660 KB Output is correct
12 Correct 1 ms 2660 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2664 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2660 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2664 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2660 KB Output is correct
12 Correct 1 ms 2660 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 1 ms 2644 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 6 ms 3028 KB Output is correct
24 Correct 6 ms 3028 KB Output is correct
25 Correct 6 ms 3060 KB Output is correct
26 Correct 10 ms 3412 KB Output is correct
27 Correct 10 ms 3444 KB Output is correct
28 Correct 10 ms 3668 KB Output is correct
29 Correct 10 ms 3188 KB Output is correct
30 Correct 11 ms 3540 KB Output is correct
31 Correct 11 ms 4052 KB Output is correct

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2664 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2660 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 2 ms 2664 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2660 KB Output is correct
12 Correct 1 ms 2660 KB Output is correct
13 Correct 1 ms 2644 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 1 ms 2644 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 6 ms 3028 KB Output is correct
24 Correct 6 ms 3028 KB Output is correct
25 Correct 6 ms 3060 KB Output is correct
26 Correct 10 ms 3412 KB Output is correct
27 Correct 10 ms 3444 KB Output is correct
28 Correct 10 ms 3668 KB Output is correct
29 Correct 10 ms 3188 KB Output is correct
30 Correct 11 ms 3540 KB Output is correct
31 Correct 11 ms 4052 KB Output is correct
32 Correct 65 ms 6836 KB Output is correct
33 Correct 52 ms 6832 KB Output is correct
34 Correct 46 ms 6744 KB Output is correct
35 Runtime error 211 ms 28568 KB Execution killed with signal 11
36 Halted 0 ms 0 KB -