Submission #198925

# Submission time Handle Problem Language Result Execution time Memory
198925 2020-01-28T07:13:11 Z red1108 Beads and wires (APIO14_beads) C++17
100 / 100
335 ms 41064 KB
#include<bits/stdc++.h>
#include<ext/rope>
using namespace std;
using namespace __gnu_cxx;
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false);cin.tie(0)
#define fopen freopen("input.txt", "r", stdin)
#define eb emplace_back
#define em emplace
#define prec(a) cout<<fixed;cout.precision(a);
#define all(a) (a).begin(), (a).end()
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> tiii;
const ll INF = 2e16;
const ll inf = 2e9;
template<class T>
void pr(T t) {cout << t << " ";}
template<class T, class ...Args>
void pr(T a, Args ...args) {cout << a << " ";pr(args...);}
template<class ...Args>
void prl(Args ...args) {pr(args...);cout << endl;}
 
int n;
const int MAXN=200010;
vector<pll> tree[MAXN];
ll dp1[MAXN],dp2[MAXN],dp3[MAXN],dp4[MAXN],ans;
void dfs(int x, int par, ll bac){
	dp2[x]=dp3[x]=dp4[x]=-inf;
	ll sum=0;
	vector<pll> h1,h3,h4,hh;
	int c=0;
	for(auto i:tree[x]) if(i.fi!=par){
		dfs(i.fi,x,i.se);
		ll tmp = max(dp1[i.fi], dp2[i.fi]);
		dp1[x]+=tmp;
		sum+=tmp;
		c++;
		h1.eb(dp1[i.fi]+i.se-tmp,i.fi);
		h3.eb(dp3[i.fi]+i.se-tmp,i.fi);
		h4.eb(max(dp3[i.fi]+i.se,dp4[i.fi])-tmp,i.fi);
		hh.eb(max(dp3[i.fi],dp4[i.fi])-tmp,i.fi);
	}
	sort(all(h1));reverse(all(h1));
	sort(all(h3));reverse(all(h3));
	sort(all(h4));reverse(all(h4));
	sort(all(hh));reverse(all(hh));
	if(c>=1){
		dp2[x] = max(dp2[x],sum + h1[0].fi + bac);
		dp4[x] = max(dp4[x],sum + h3[0].fi + bac);
		dp3[x] = max(dp3[x],sum + hh[0].fi);
	}
	if(c>=2){
		for(int i=0;i<2;i++)
			for(int j=0;j<2;j++)
				if(h1[i].se!=h3[j].se)
					dp3[x] = max(dp3[x], sum + h1[i].fi+h3[j].fi);
		dp3[x] = max(dp3[x], sum + h1[0].fi+h1[1].fi);
	}
}
int main(){
	fastio;
	cin>>n;
	for(int i=1;i<n;i++){
		int a, b, c;cin>>a>>b>>c;
		tree[a].eb(b,c);
		tree[b].eb(a,c);
	}
	dfs(1,0,0);
	cout<<max(dp1[1],dp3[1]);
}
# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 9 ms 4984 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 9 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 9 ms 4984 KB Output is correct
7 Correct 8 ms 4984 KB Output is correct
8 Correct 8 ms 4988 KB Output is correct
9 Correct 8 ms 4984 KB Output is correct
10 Correct 8 ms 4984 KB Output is correct
11 Correct 8 ms 4984 KB Output is correct
12 Correct 9 ms 5112 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 9 ms 4984 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 9 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 9 ms 4984 KB Output is correct
7 Correct 8 ms 4984 KB Output is correct
8 Correct 8 ms 4988 KB Output is correct
9 Correct 8 ms 4984 KB Output is correct
10 Correct 8 ms 4984 KB Output is correct
11 Correct 8 ms 4984 KB Output is correct
12 Correct 9 ms 5112 KB Output is correct
13 Correct 8 ms 5112 KB Output is correct
14 Correct 8 ms 4984 KB Output is correct
15 Correct 9 ms 5112 KB Output is correct
16 Correct 8 ms 5112 KB Output is correct
17 Correct 9 ms 5112 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct
19 Correct 8 ms 5116 KB Output is correct
20 Correct 9 ms 5112 KB Output is correct
21 Correct 9 ms 5112 KB Output is correct
22 Correct 9 ms 5240 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 9 ms 4984 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 9 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 9 ms 4984 KB Output is correct
7 Correct 8 ms 4984 KB Output is correct
8 Correct 8 ms 4988 KB Output is correct
9 Correct 8 ms 4984 KB Output is correct
10 Correct 8 ms 4984 KB Output is correct
11 Correct 8 ms 4984 KB Output is correct
12 Correct 9 ms 5112 KB Output is correct
13 Correct 8 ms 5112 KB Output is correct
14 Correct 8 ms 4984 KB Output is correct
15 Correct 9 ms 5112 KB Output is correct
16 Correct 8 ms 5112 KB Output is correct
17 Correct 9 ms 5112 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct
19 Correct 8 ms 5116 KB Output is correct
20 Correct 9 ms 5112 KB Output is correct
21 Correct 9 ms 5112 KB Output is correct
22 Correct 9 ms 5240 KB Output is correct
23 Correct 15 ms 5496 KB Output is correct
24 Correct 12 ms 5496 KB Output is correct
25 Correct 12 ms 5496 KB Output is correct
26 Correct 16 ms 5880 KB Output is correct
27 Correct 16 ms 5884 KB Output is correct
28 Correct 18 ms 7028 KB Output is correct
29 Correct 20 ms 6396 KB Output is correct
30 Correct 17 ms 6488 KB Output is correct
31 Correct 17 ms 7160 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 5112 KB Output is correct
2 Correct 9 ms 4984 KB Output is correct
3 Correct 8 ms 5112 KB Output is correct
4 Correct 9 ms 4984 KB Output is correct
5 Correct 8 ms 4984 KB Output is correct
6 Correct 9 ms 4984 KB Output is correct
7 Correct 8 ms 4984 KB Output is correct
8 Correct 8 ms 4988 KB Output is correct
9 Correct 8 ms 4984 KB Output is correct
10 Correct 8 ms 4984 KB Output is correct
11 Correct 8 ms 4984 KB Output is correct
12 Correct 9 ms 5112 KB Output is correct
13 Correct 8 ms 5112 KB Output is correct
14 Correct 8 ms 4984 KB Output is correct
15 Correct 9 ms 5112 KB Output is correct
16 Correct 8 ms 5112 KB Output is correct
17 Correct 9 ms 5112 KB Output is correct
18 Correct 8 ms 5112 KB Output is correct
19 Correct 8 ms 5116 KB Output is correct
20 Correct 9 ms 5112 KB Output is correct
21 Correct 9 ms 5112 KB Output is correct
22 Correct 9 ms 5240 KB Output is correct
23 Correct 15 ms 5496 KB Output is correct
24 Correct 12 ms 5496 KB Output is correct
25 Correct 12 ms 5496 KB Output is correct
26 Correct 16 ms 5880 KB Output is correct
27 Correct 16 ms 5884 KB Output is correct
28 Correct 18 ms 7028 KB Output is correct
29 Correct 20 ms 6396 KB Output is correct
30 Correct 17 ms 6488 KB Output is correct
31 Correct 17 ms 7160 KB Output is correct
32 Correct 61 ms 9208 KB Output is correct
33 Correct 62 ms 9208 KB Output is correct
34 Correct 61 ms 9208 KB Output is correct
35 Correct 303 ms 21684 KB Output is correct
36 Correct 313 ms 21652 KB Output is correct
37 Correct 312 ms 21752 KB Output is correct
38 Correct 278 ms 39260 KB Output is correct
39 Correct 288 ms 33228 KB Output is correct
40 Correct 284 ms 31432 KB Output is correct
41 Correct 335 ms 41064 KB Output is correct