oj.uz

Submission #491225

# Submission time Handle Problem Language Result Execution time Memory
491225 2021-11-30T23:34:27 Z tar_palantir Beads and wires (APIO14_beads) C++17
100 / 100
 179 ms 29100 KB 
// INCOMPLETE

#include<bits/stdc++.h>
#define int     long long
#define task    "beads"
using namespace std;
using ii=pair<int,int>;

const int mn=2e5+11,inf=0x3f3f3f3f3f3f3f3f;
const int mk=111;

int n;
vector<ii>adj[mn];

template<typename _t>
bool ckmax(_t& target,const _t& source){
	return target<source ? target=source, 1 : 0;
}

int dp[mn][4];
void dfs(int u,int pre){
	vector<int>mval(5,-inf);
	for(const ii& k:adj[u]){
		int v=k.first,w=k.second;
		if(v==pre)continue;
		
		dfs(v,u);
	
		int eval=max(dp[v][0],dp[v][2]+w);
		dp[u][0]+=eval;
		
		ckmax(mval[4],max(dp[v][1],dp[v][3]+w)-eval);
		ckmax(mval[1],max(mval[2]+max(dp[v][0],dp[v][1])+w,mval[3]+dp[v][0]+w)-eval);
		
		ckmax(mval[2],dp[v][0]+w-eval);
		ckmax(mval[3],dp[v][1]+w-eval);
	}
	
	dp[u][1]=dp[u][0]+max(mval[1],mval[4]);
	dp[u][2]=dp[u][0]+mval[2];
	dp[u][3]=dp[u][0]+mval[3];
}

int32_t main()
{
    cin.tie(0)->sync_with_stdio(0);

    cin>>n;
    for(int i=1,u,v,w;i<n;i++){
    	cin>>u>>v>>w;
    	adj[u].emplace_back(v,w);
    	adj[v].emplace_back(u,w);
    }
    
    dfs(1,-1);
    cout<<max(dp[1][0],dp[1][1]);
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4940 KB Output is correct
2 Correct 3 ms 5004 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 2 ms 5032 KB Output is correct
5 Correct 2 ms 5020 KB Output is correct
6 Correct 3 ms 5024 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 2 ms 4896 KB Output is correct
9 Correct 2 ms 4940 KB Output is correct
10 Correct 3 ms 5020 KB Output is correct
11 Correct 2 ms 4940 KB Output is correct
12 Correct 2 ms 4940 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4940 KB Output is correct
2 Correct 3 ms 5004 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 2 ms 5032 KB Output is correct
5 Correct 2 ms 5020 KB Output is correct
6 Correct 3 ms 5024 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 2 ms 4896 KB Output is correct
9 Correct 2 ms 4940 KB Output is correct
10 Correct 3 ms 5020 KB Output is correct
11 Correct 2 ms 4940 KB Output is correct
12 Correct 2 ms 4940 KB Output is correct
13 Correct 2 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 ms 4988 KB Output is correct
20 Correct 3 ms 5020 KB Output is correct
21 Correct 2 ms 5020 KB Output is correct
22 Correct 3 ms 5020 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4940 KB Output is correct
2 Correct 3 ms 5004 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 2 ms 5032 KB Output is correct
5 Correct 2 ms 5020 KB Output is correct
6 Correct 3 ms 5024 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 2 ms 4896 KB Output is correct
9 Correct 2 ms 4940 KB Output is correct
10 Correct 3 ms 5020 KB Output is correct
11 Correct 2 ms 4940 KB Output is correct
12 Correct 2 ms 4940 KB Output is correct
13 Correct 2 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 ms 4988 KB Output is correct
20 Correct 3 ms 5020 KB Output is correct
21 Correct 2 ms 5020 KB Output is correct
22 Correct 3 ms 5020 KB Output is correct
23 Correct 4 ms 5452 KB Output is correct
24 Correct 4 ms 5452 KB Output is correct
25 Correct 4 ms 5416 KB Output is correct
26 Correct 6 ms 5932 KB Output is correct
27 Correct 7 ms 5932 KB Output is correct
28 Correct 6 ms 5960 KB Output is correct
29 Correct 6 ms 5964 KB Output is correct
30 Correct 6 ms 5964 KB Output is correct
31 Correct 7 ms 6460 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4940 KB Output is correct
2 Correct 3 ms 5004 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 2 ms 5032 KB Output is correct
5 Correct 2 ms 5020 KB Output is correct
6 Correct 3 ms 5024 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 2 ms 4896 KB Output is correct
9 Correct 2 ms 4940 KB Output is correct
10 Correct 3 ms 5020 KB Output is correct
11 Correct 2 ms 4940 KB Output is correct
12 Correct 2 ms 4940 KB Output is correct
13 Correct 2 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 4940 KB Output is correct
19 Correct 4 ms 4988 KB Output is correct
20 Correct 3 ms 5020 KB Output is correct
21 Correct 2 ms 5020 KB Output is correct
22 Correct 3 ms 5020 KB Output is correct
23 Correct 4 ms 5452 KB Output is correct
24 Correct 4 ms 5452 KB Output is correct
25 Correct 4 ms 5416 KB Output is correct
26 Correct 6 ms 5932 KB Output is correct
27 Correct 7 ms 5932 KB Output is correct
28 Correct 6 ms 5960 KB Output is correct
29 Correct 6 ms 5964 KB Output is correct
30 Correct 6 ms 5964 KB Output is correct
31 Correct 7 ms 6460 KB Output is correct
32 Correct 24 ms 9852 KB Output is correct
33 Correct 32 ms 9812 KB Output is correct
34 Correct 25 ms 9804 KB Output is correct
35 Correct 173 ms 23160 KB Output is correct
36 Correct 153 ms 23180 KB Output is correct
37 Correct 179 ms 23148 KB Output is correct
38 Correct 127 ms 22340 KB Output is correct
39 Correct 117 ms 22284 KB Output is correct
40 Correct 103 ms 22264 KB Output is correct
41 Correct 145 ms 29100 KB Output is correct