Submission #670212

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
670212	2022-12-08T09:59:54 Z	radal	Beads and wires (APIO14_beads)	C++17	100 / 100	172 ms	25408 KB

beads

#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,avx2")
#pragma GCC optimize("unroll-loops,O2")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> pll;
constexpr int N = 2e5+10,mod = 1e9+7,maxm = 210;
constexpr ll inf = 1e9+10;
inline int mkay(int a,int b){
    if (a+b >= mod) return a+b-mod;
   // if (a+b < 0) return a+b+mod;
    return a+b;
}
 
inline int poww(int a,int k){
    if (k < 0) return 0;
    int z = 1;
    while (k){
        if (k&1) z = 1ll*z*a%mod;
        a = 1ll*a*a%mod;
        k >>= 1;
    } 
    return z; 
}
 
vector<pll> adj[N];
int dp[N][2][2]; // good e
 
void dfs(int v,int p){
	if ((int) adj[v].size() == 1 && p != 0){
		dp[v][0][1] = dp[v][1][1] = -2*inf;
		dp[v][0][0] = dp[v][1][0] = 0;
		return;
	}
	int s = 0,mx = -2*inf;
	int mx2 = -2*inf;
	vector<int> ve;
	for (auto [u,w] : adj[v]){
		if (u == p) continue;
		dfs(u,v);
		int val = max(dp[u][1][0],dp[u][1][1]+w);
		s += val;
		mx = max(mx,dp[u][1][0]-val+w);

		int val2 = max(dp[u][0][0],dp[u][0][1]+w);
		mx2 = max(mx2,val2-val);
		ve.pb(dp[u][0][0]-val+w);
	}
	sort(all(ve));
	dp[v][1][0] = s;
	dp[v][1][1] = s + mx;
	dp[v][0][0] = s;
	dp[v][0][0] = max(dp[v][0][0],s+mx2);
	dp[v][0][1] = s+ve.back();
	int sz = ve.size();
	if (sz == 1) return;
	for (auto [u,w] : adj[v]){
		if (u == p) continue;
        int val = max(dp[u][1][0],dp[u][1][1]+w);
		if (ve.back() != dp[u][0][0]-val+w){
			dp[v][0][0] = max(dp[v][0][0],s-val+ve.back()+w+dp[u][1][0]);
		}
		else{
            dp[v][0][0] = max(dp[v][0][0],s-val+ve[sz-2]+w+dp[u][1][0]);
		}
	}
}
 
bool cmp(int i,int j){
	return adj[i][0].Y > adj[j][0].Y;
}

int main(){
	ios :: sync_with_stdio(0); cin.tie(0); 
	int n;
	cin >> n;
	rep(i,1,n){
		int u,v,w;
		cin >> u >> v >> w;
		adj[u].pb({v,w});
		adj[v].pb({u,w});
	}
	if (n <= 2){
		cout << 0 << endl;
		return 0;
	}
	dfs(1,0);
	cout << dp[1][0][0] << endl;
}

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	5020 KB	Output is correct
3	Correct	3 ms	5020 KB	Output is correct
4	Correct	3 ms	5028 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	5024 KB	Output is correct
7	Correct	2 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	3 ms	4948 KB	Output is correct
10	Correct	3 ms	5028 KB	Output is correct
11	Correct	3 ms	5020 KB	Output is correct
12	Correct	3 ms	5020 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	5020 KB	Output is correct
3	Correct	3 ms	5020 KB	Output is correct
4	Correct	3 ms	5028 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	5024 KB	Output is correct
7	Correct	2 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	3 ms	4948 KB	Output is correct
10	Correct	3 ms	5028 KB	Output is correct
11	Correct	3 ms	5020 KB	Output is correct
12	Correct	3 ms	5020 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	5028 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	3 ms	5024 KB	Output is correct
20	Correct	3 ms	4948 KB	Output is correct
21	Correct	3 ms	4948 KB	Output is correct
22	Correct	3 ms	5040 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	5020 KB	Output is correct
3	Correct	3 ms	5020 KB	Output is correct
4	Correct	3 ms	5028 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	5024 KB	Output is correct
7	Correct	2 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	3 ms	4948 KB	Output is correct
10	Correct	3 ms	5028 KB	Output is correct
11	Correct	3 ms	5020 KB	Output is correct
12	Correct	3 ms	5020 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	5028 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	3 ms	5024 KB	Output is correct
20	Correct	3 ms	4948 KB	Output is correct
21	Correct	3 ms	4948 KB	Output is correct
22	Correct	3 ms	5040 KB	Output is correct
23	Correct	5 ms	5332 KB	Output is correct
24	Correct	5 ms	5256 KB	Output is correct
25	Correct	5 ms	5332 KB	Output is correct
26	Correct	7 ms	5680 KB	Output is correct
27	Correct	7 ms	5676 KB	Output is correct
28	Correct	6 ms	5844 KB	Output is correct
29	Correct	7 ms	5692 KB	Output is correct
30	Correct	9 ms	5716 KB	Output is correct
31	Correct	7 ms	6356 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	5020 KB	Output is correct
3	Correct	3 ms	5020 KB	Output is correct
4	Correct	3 ms	5028 KB	Output is correct
5	Correct	3 ms	4948 KB	Output is correct
6	Correct	3 ms	5024 KB	Output is correct
7	Correct	2 ms	4948 KB	Output is correct
8	Correct	2 ms	4948 KB	Output is correct
9	Correct	3 ms	4948 KB	Output is correct
10	Correct	3 ms	5028 KB	Output is correct
11	Correct	3 ms	5020 KB	Output is correct
12	Correct	3 ms	5020 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	5028 KB	Output is correct
18	Correct	3 ms	4948 KB	Output is correct
19	Correct	3 ms	5024 KB	Output is correct
20	Correct	3 ms	4948 KB	Output is correct
21	Correct	3 ms	4948 KB	Output is correct
22	Correct	3 ms	5040 KB	Output is correct
23	Correct	5 ms	5332 KB	Output is correct
24	Correct	5 ms	5256 KB	Output is correct
25	Correct	5 ms	5332 KB	Output is correct
26	Correct	7 ms	5680 KB	Output is correct
27	Correct	7 ms	5676 KB	Output is correct
28	Correct	6 ms	5844 KB	Output is correct
29	Correct	7 ms	5692 KB	Output is correct
30	Correct	9 ms	5716 KB	Output is correct
31	Correct	7 ms	6356 KB	Output is correct
32	Correct	26 ms	8404 KB	Output is correct
33	Correct	24 ms	8404 KB	Output is correct
34	Correct	25 ms	8356 KB	Output is correct
35	Correct	138 ms	16520 KB	Output is correct
36	Correct	172 ms	16460 KB	Output is correct
37	Correct	166 ms	16460 KB	Output is correct
38	Correct	96 ms	18580 KB	Output is correct
39	Correct	108 ms	17904 KB	Output is correct
40	Correct	93 ms	17672 KB	Output is correct
41	Correct	128 ms	25408 KB	Output is correct

Submission #670212

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 15.0 / 15.0

Subtask #3 29.0 / 29.0

Subtask #4 43.0 / 43.0

Subtask #1
13.0 / 13.0

Subtask #2
15.0 / 15.0

Subtask #3
29.0 / 29.0

Subtask #4
43.0 / 43.0