oj.uz

Submission #344460

# Submission time Handle Problem Language Result Execution time Memory
344460 2021-01-05T20:37:57 Z wwdd Beads and wires (APIO14_beads) C++14
100 / 100
 359 ms 44580 KB 
//even grosser
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vpl> al;
struct EG {
	ll st,ed,wo;
};
const ll INFL = 1e18;
const int MN = 200200;
ll dp[MN][2][2];
bool bp[MN][2][2];
vl lev;
vvi g;
void dfa(int u, int p) {
	if(u != p) {
		lev[u] = lev[p]+1;
	}
	for(int i=0;i<g[u].size();i++) {
		int v = g[u][i];
		if(v == p) {continue;}
		dfa(v,u);
	}
}
vl ko;
ll ds(int u, int p, int m, int sp) {
	if(bp[u][m][sp]) {
		return dp[u][m][sp];
	}
	ll res;
	if(m) {
		if(g[u].size() >= 1) {
			res = 0;
			ll ma = -INFL;
			for(int i=0;i<g[u].size();i++) {
				int v = g[u][i];
				if(v == p) {continue;}
				ll mv = max(ko[v]+ds(v,u,1,0),ds(v,u,0,0));
				res += mv;
				ma = max(ma,ko[v]+ds(v,u,0,sp)-mv);
			}
			res += ma;
		} else {
			res = -INFL;
		}
	} else {
		res = 0;
		vector<pl> nu,du;
		ll ma = -INFL;
		for(int i=0;i<g[u].size();i++) {
			int v = g[u][i];
			if(v == p) {continue;}
			ll mv = max(ds(v,u,0,0),ko[v]+ds(v,u,1,0));
			ma = max(ma,max(ds(v,u,0,1),ko[v]+ds(v,u,1,1))-mv);
			res += mv;
			du.emplace_back(ko[v]+ds(v,u,0,0)-mv,v);
			nu.emplace_back(ko[v]+ds(v,u,0,1)-mv,v);
		}
		if(sp) {
			ll ad = max(0LL,ma);
			if(du.size() >= 2) {
				sort(du.rbegin(),du.rend());
				sort(nu.rbegin(),nu.rend());
				for(int i=0;i<2;i++) {
					for(int j=0;j<2;j++) {
						if(nu[i].second != du[j].second) {
							ad = max(ad,nu[i].first+du[j].first);
						}
					}
				}
			}
			res += ad;
		}
	}
	bp[u][m][sp] = true;
	return dp[u][m][sp] = res;
}
int main() {
	ios::sync_with_stdio(0);cin.tie(0);
	memset(bp,0,sizeof(bp));
	ll n;
	cin >> n;
	lev.assign(n,0);
	g.assign(n,vi());
	ko.assign(n,0);
	vector<EG> el;
	for(int i=1;i<n;i++) {
		ll a,b,c;
		cin >> a >> b >> c;
		a--;b--;
		g[a].push_back(b);
		g[b].push_back(a);
		el.push_back({a,b,c});
	}
	dfa(0,0);
	for(int i=0;i<el.size();i++) {
		ll a = el[i].st;
		ll b = el[i].ed;
		if(lev[a] > lev[b]) {swap(a,b);}
		ko[b] = el[i].wo;
	}
	cout << ds(0,0,0,1) << '\n';
}

Compilation message

beads.cpp: In function 'void dfa(int, int)':
beads.cpp:24:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |  for(int i=0;i<g[u].size();i++) {
      |              ~^~~~~~~~~~~~
beads.cpp: In function 'll ds(int, int, int, int)':
beads.cpp:40:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |    for(int i=0;i<g[u].size();i++) {
      |                ~^~~~~~~~~~~~
beads.cpp:55:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |   for(int i=0;i<g[u].size();i++) {
      |               ~^~~~~~~~~~~~
beads.cpp: In function 'int main()':
beads.cpp:101:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<EG>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |  for(int i=0;i<el.size();i++) {
      |              ~^~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1064 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1132 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 1 ms 1132 KB Output is correct
12 Correct 1 ms 1132 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1064 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1132 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 1 ms 1132 KB Output is correct
12 Correct 1 ms 1132 KB Output is correct
13 Correct 1 ms 1132 KB Output is correct
14 Correct 1 ms 1132 KB Output is correct
15 Correct 1 ms 1152 KB Output is correct
16 Correct 1 ms 1132 KB Output is correct
17 Correct 1 ms 1132 KB Output is correct
18 Correct 1 ms 1132 KB Output is correct
19 Correct 1 ms 1152 KB Output is correct
20 Correct 1 ms 1132 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1132 KB Output is correct
23 Correct 6 ms 1900 KB Output is correct
24 Correct 5 ms 1900 KB Output is correct
25 Correct 5 ms 1900 KB Output is correct
26 Correct 10 ms 2748 KB Output is correct
27 Correct 13 ms 2600 KB Output is correct
28 Correct 11 ms 3364 KB Output is correct
29 Correct 10 ms 2856 KB Output is correct
30 Correct 10 ms 2856 KB Output is correct
31 Correct 11 ms 3624 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1132 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1132 KB Output is correct
5 Correct 1 ms 1132 KB Output is correct
6 Correct 1 ms 1064 KB Output is correct
7 Correct 1 ms 1132 KB Output is correct
8 Correct 1 ms 1152 KB Output is correct
9 Correct 1 ms 1132 KB Output is correct
10 Correct 1 ms 1132 KB Output is correct
11 Correct 1 ms 1132 KB Output is correct
12 Correct 1 ms 1132 KB Output is correct
13 Correct 1 ms 1132 KB Output is correct
14 Correct 1 ms 1132 KB Output is correct
15 Correct 1 ms 1152 KB Output is correct
16 Correct 1 ms 1132 KB Output is correct
17 Correct 1 ms 1132 KB Output is correct
18 Correct 1 ms 1132 KB Output is correct
19 Correct 1 ms 1152 KB Output is correct
20 Correct 1 ms 1132 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1132 KB Output is correct
23 Correct 6 ms 1900 KB Output is correct
24 Correct 5 ms 1900 KB Output is correct
25 Correct 5 ms 1900 KB Output is correct
26 Correct 10 ms 2748 KB Output is correct
27 Correct 13 ms 2600 KB Output is correct
28 Correct 11 ms 3364 KB Output is correct
29 Correct 10 ms 2856 KB Output is correct
30 Correct 10 ms 2856 KB Output is correct
31 Correct 11 ms 3624 KB Output is correct
32 Correct 52 ms 8224 KB Output is correct
33 Correct 57 ms 8232 KB Output is correct
34 Correct 55 ms 8224 KB Output is correct
35 Correct 302 ms 29840 KB Output is correct
36 Correct 302 ms 29968 KB Output is correct
37 Correct 308 ms 29968 KB Output is correct
38 Correct 341 ms 41616 KB Output is correct
39 Correct 322 ms 37592 KB Output is correct
40 Correct 317 ms 35752 KB Output is correct
41 Correct 359 ms 44580 KB Output is correct