oj.uz

Submission #676974

# Submission time Handle Problem Language Result Execution time Memory
676974 2023-01-01T22:25:50 Z amirhoseinfar1385 Beads and wires (APIO14_beads) C++17
100 / 100
 204 ms 39360 KB 
#include<bits/stdc++.h>
using namespace std;
const long long maxn=200000+5;
vector<pair<long long,long long>>adj[maxn];
long long dp11[maxn],dp10[maxn],dp01[maxn],dp00[maxn];
long long n;
long long inf=1e15;

void solve(long long u=1,long long par=0){
	vector<pair<long long,long long>>fake;
	for(auto x:adj[u]){
		if(x.first==par)
		{
			continue;
		}
		fake.push_back(x);
		solve(x.first,u);
	}
	//dp00
	for(auto x:fake){
		dp00[u]+=max(dp10[x.first]+x.second,dp00[x.first]);
	}	
	//dp10
	for(auto x:fake){
		dp10[u]=max(dp10[u],dp00[u]-max(dp10[x.first]+x.second,dp00[x.first])+dp00[x.first]+x.second);
	}
	//cout<<u<<" "<<dp10[u]<<" "<<dp00[u]<<endl;
    //dp11
    dp11[u]=dp10[u];
    for(auto x:fake){
    	dp11[u]=max(dp11[u],dp00[u]-max(dp10[x.first]+x.second,dp00[x.first])+max(dp01[x.first]+x.second,dp00[x.first]+x.second));
    }
    //dp01
    dp01[u]=dp00[u];
    for(auto x:fake){
    	dp01[u]=max(dp01[u],dp00[u]-max(dp10[x.first]+x.second,dp00[x.first])+max(dp11[x.first]+x.second,dp01[x.first]));
    }
    if((long long)fake.size()==0){
    	dp10[u]=-(inf/100);
    	dp11[u]=-(inf/100);
    	dp01[u]=0;
    	dp00[u]=0;
    }
    if((long long)fake.size()<=1){
    	return ;
    }
    vector<long long>p1((long long)fake.size()),p0((long long)fake.size()),s1((long long)fake.size()),s0((long long)fake.size());
    for(long long i=0;i<(long long)fake.size();i++){
    	auto x=fake[i];
    	if(i==0){
    		p1[i]+=dp00[x.first]+x.second;
    		p0[i]+=max(dp10[x.first]+x.second,dp00[x.first]);
    	}
    	else{	
    		p1[i]=p1[i-1];
    		p0[i]=p0[i-1];
    		p1[i]=max(p0[i-1]+dp00[x.first]+x.second,p1[i-1]+max(dp10[x.first]+x.second,dp00[x.first]));
    		p0[i]+=max(dp10[x.first]+x.second,dp00[x.first]);
    	}
    }
    for(long long i=(long long)fake.size()-1;i>=0;i--){
   		auto x=fake[i];
    	if(i==(int)fake.size()-1){
    		s1[i]+=dp00[x.first]+x.second;
    		s0[i]+=max(dp10[x.first]+x.second,dp00[x.first]);
    	}
    	else{	
    		s1[i]=s1[i+1];
    		s0[i]=s0[i+1];
    		s1[i]=max(s0[i+1]+dp00[x.first]+x.second,s1[i+1]+max(dp10[x.first]+x.second,dp00[x.first]));
    		s0[i]+=max(dp10[x.first]+x.second,dp00[x.first]);
    	}
    }
    for(long long i=0;i<(long long)fake.size();i++){
    	auto x=fake[i];
    	if(i==0){
    		dp01[u]=max(dp01[u],dp01[x.first]+x.second+s1[i+1]);
    	}
    	else if(i==(long long)fake.size()-1){
    		dp01[u]=max(dp01[u],dp01[x.first]+x.second+p1[i-1]);
    	}
    	else{
    		dp01[u]=max(dp01[u],dp01[x.first]+x.second+s1[i+1]+p0[i-1]);
       		dp01[u]=max(dp01[u],dp01[x.first]+x.second+p1[i-1]+s0[i+1]);
    	}
    }
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=0;i<maxn;i++){
		dp10[i]=dp11[i]=dp01[i]=-inf;
	}
	long long suma=0;
	for(long long i=0;i<n-1;i++){
		long long u,v,w;
		cin>>u>>v>>w;
		adj[u].push_back(make_pair(v,w));
		adj[v].push_back(make_pair(u,w));
	}
	solve();
//	cout<<dp00[2]<<endl;
	//cout<<dp00[1]<<" "<<dp01[1]<<endl;
	long long res=max(dp01[1],dp00[1]);
	cout<<res<<endl;
}

Compilation message

beads.cpp: In function 'int main()':
beads.cpp:96:12: warning: unused variable 'suma' [-Wunused-variable]
   96 |  long long suma=0;
      |            ^~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 4 ms 9608 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 5 ms 9688 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9640 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 4 ms 9608 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 5 ms 9688 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9640 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 5 ms 9632 KB Output is correct
21 Correct 6 ms 9628 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 4 ms 9608 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 5 ms 9688 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9640 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 5 ms 9632 KB Output is correct
21 Correct 6 ms 9628 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 9 ms 10068 KB Output is correct
24 Correct 7 ms 10036 KB Output is correct
25 Correct 7 ms 10068 KB Output is correct
26 Correct 9 ms 10412 KB Output is correct
27 Correct 9 ms 10420 KB Output is correct
28 Correct 10 ms 10864 KB Output is correct
29 Correct 11 ms 10696 KB Output is correct
30 Correct 9 ms 10580 KB Output is correct
31 Correct 9 ms 11704 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 5 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 5 ms 9684 KB Output is correct
7 Correct 4 ms 9608 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 5 ms 9688 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9640 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9684 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 5 ms 9632 KB Output is correct
21 Correct 6 ms 9628 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 9 ms 10068 KB Output is correct
24 Correct 7 ms 10036 KB Output is correct
25 Correct 7 ms 10068 KB Output is correct
26 Correct 9 ms 10412 KB Output is correct
27 Correct 9 ms 10420 KB Output is correct
28 Correct 10 ms 10864 KB Output is correct
29 Correct 11 ms 10696 KB Output is correct
30 Correct 9 ms 10580 KB Output is correct
31 Correct 9 ms 11704 KB Output is correct
32 Correct 34 ms 13516 KB Output is correct
33 Correct 34 ms 13316 KB Output is correct
34 Correct 33 ms 13384 KB Output is correct
35 Correct 182 ms 25048 KB Output is correct
36 Correct 189 ms 25052 KB Output is correct
37 Correct 191 ms 25036 KB Output is correct
38 Correct 133 ms 32780 KB Output is correct
39 Correct 118 ms 28844 KB Output is correct
40 Correct 120 ms 28208 KB Output is correct
41 Correct 204 ms 39360 KB Output is correct