oj.uz

Submission #794348

# Submission time Handle Problem Language Result Execution time Memory
794348 2023-07-26T13:06:16 Z 곰(#10095) Travelling Trader (CCO23_day2problem2) C++17
25 / 25
 337 ms 85448 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
using ll=long long;
using pll=array<ll,2>;
const ll inf=1e18;
const int N=2e5+5;
int n,k;
ll a[N],s[N],dp[N][4];
vector<int> g[N],c[N],cc[N],ans;
void dfs1(int u,int p){
	dp[u][0]=a[u];
	for(int v: g[u]) if(p!=v){
		c[u].emplace_back(v);
		dfs1(v,u);
		dp[u][0]=max(dp[u][0],dp[v][0]+a[u]);
	}
}
void track1(int u){
	ans.emplace_back(u);
	for(int v: c[u]) if(dp[u][0]==dp[v][0]+a[u]){
		track1(v);
		return;
	}
}
void dfs2(int u,int p){
	s[u]=a[u];
	for(int v: g[u]) if(p!=v){
		cc[u].emplace_back(v);
		dfs2(v,u);
		s[u]+=a[v];
	}
	for(int t=0;t<4;t++){
		sort(cc[u].begin(),cc[u].end(),[&](int i,int j){
			return dp[i][t]-a[i]>dp[j][t]-a[j];
		});
		for(int i=0;i<min((int)cc[u].size(),5);i++) c[u].emplace_back(cc[u][i]);
	}
	{
		sort(cc[u].begin(),cc[u].end(),[&](int i,int j){
			return dp[i][3]>dp[j][3];
		});
		for(int i=0;i<min((int)cc[u].size(),5);i++) c[u].emplace_back(cc[u][i]);
	}
	sort(c[u].begin(),c[u].end());
	c[u].resize(unique(c[u].begin(),c[u].end())-c[u].begin());
	dp[u][0]=a[u];
	dp[u][1]=a[u];
	dp[u][2]=a[u];
	dp[u][3]=a[u];
	for(int v: c[u]){
		dp[u][0]=max(dp[u][0],dp[v][0]+s[u]-a[v]);
		dp[u][0]=max(dp[u][0],dp[v][3]+a[u]);
		for(int w: c[u]) if(v!=w){
			dp[u][0]=max(dp[u][0],dp[v][1]+dp[w][0]+s[u]-a[v]-a[w]);
		}
		dp[u][1]=max(dp[u][1],dp[v][2]+s[u]-a[v]);
		dp[u][2]=max(dp[u][2],dp[v][1]+s[u]-a[v]);
		for(int w: c[u]) if(v!=w){
			dp[u][3]=max(dp[u][3],dp[v][2]+dp[w][3]+s[u]-a[v]-a[w]);
			for(int x: c[u]) if(v!=x&&w!=x){
				dp[u][3]=max(dp[u][3],dp[v][2]+dp[w][1]+dp[x][0]+s[u]-a[v]-a[w]-a[x]);
			}
		}
	}
	dp[u][3]=max(dp[u][3],dp[u][0]);
}
void track2(int u,int d){
	if(d==0){
		ans.emplace_back(u);
		for(int v: cc[u]){
			if(dp[u][0]==dp[v][0]+s[u]-a[v]){
				for(int w: cc[u]) if(v!=w) ans.emplace_back(w);
				track2(v,0);
				return;
			}
			if(dp[u][0]==dp[v][3]+a[u]){
				track2(v,3);
				return;
			}
		}
		for(int v: cc[u]) for(int w: cc[u]) if(v!=w&&dp[u][0]==dp[v][1]+dp[w][0]+s[u]-a[v]-a[w]){
			track2(v,1);
			for(int x: cc[u]) if(v!=x&&w!=x) ans.emplace_back(x);
			track2(w,0);
			return;
		}
	} else if(d==1){
		for(int v: cc[u]) if(dp[u][1]==dp[v][2]+s[u]-a[v]){
			for(int w: cc[u]) if(v!=w) ans.emplace_back(w);
			track2(v,2);
			ans.emplace_back(u);
			return;
		}
		ans.emplace_back(u);
	} else if(d==2){
		ans.emplace_back(u);
		for(int v: cc[u]) if(dp[u][2]==dp[v][1]+s[u]-a[v]){
			track2(v,1);
			for(int w: cc[u]) if(v!=w) ans.emplace_back(w);
			return;
		}
	} else{
		if(dp[u][3]==dp[u][0]){
			track2(u,0);
			return;
		}
		for(int v: cc[u]){
			for(int w: cc[u]) if(v!=w){
				if(dp[u][3]==dp[v][2]+dp[w][3]+s[u]-a[v]-a[w]){
					for(int x: cc[u]) if(v!=x&&w!=x) ans.emplace_back(x);
					track2(v,2);
					ans.emplace_back(u);
					track2(w,3);
					return;
				}
				for(int x: cc[u]) if(v!=x&&w!=x){
					if(dp[u][3]==dp[v][2]+dp[w][1]+dp[x][0]+s[u]-a[v]-a[w]-a[x]){
						debug(v,w,x);
						track2(v,2);
						ans.emplace_back(u);
						track2(w,1);
						for(int y: cc[u]) if(v!=y&&w!=y&&x!=y) ans.emplace_back(y);
						track2(x,0);
						return;
					}
				}
			}
		}
	}
}
void dfs3(int u,int p){
	ans.emplace_back(u);
	for(int v: g[u]) if(p!=v){
		for(int w: g[v]) if(u!=w){
			dfs3(w,v);
		}
		ans.emplace_back(v);
	}
}
int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	cin>>n>>k;
	for(int u,v,i=1;i<n;i++){
		cin>>u>>v;
		g[u].emplace_back(v);
		g[v].emplace_back(u);
	}
	for(int i=1;i<=n;i++) cin>>a[i];
	if(k==1){
		dfs1(1,0);
		cout<<dp[1][0]<<"\n";
		track1(1);
	} else if(k==2){
		dfs2(1,0);
		cout<<dp[1][0]<<"\n";
		track2(1,0);
		ll S=0;
		for(int u: ans) S+=a[u];
		assert(dp[1][0]==S);
	} else if(k==3){
		dfs3(1,0);
		cout<<accumulate(a+1,a+n+1,0ll)<<"\n";
	}
	cout<<ans.size()<<"\n";
	for(int u: ans) cout<<u<<" ";
	return 0;
}

Compilation message

Main.cpp: In function 'void track2(int, int)':
Main.cpp:9:20: warning: statement has no effect [-Wunused-value]
    9 | #define debug(...) 42
      |                    ^~
Main.cpp:126:7: note: in expansion of macro 'debug'
  126 |       debug(v,w,x);
      |       ^~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14368 KB Output is correct
2 Correct 8 ms 14436 KB Output is correct
3 Correct 120 ms 31868 KB Output is correct
4 Correct 128 ms 31948 KB Output is correct
5 Correct 134 ms 32380 KB Output is correct
6 Correct 133 ms 30980 KB Output is correct
7 Correct 74 ms 30828 KB Output is correct
8 Correct 104 ms 32396 KB Output is correct
9 Correct 178 ms 55744 KB Output is correct
10 Correct 162 ms 42084 KB Output is correct
11 Correct 73 ms 31564 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 8 ms 14420 KB Output is correct
14 Correct 8 ms 14420 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 9 ms 14456 KB Output is correct
18 Correct 8 ms 14456 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14480 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 8 ms 14424 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14420 KB Output is correct
26 Correct 8 ms 14420 KB Output is correct
27 Correct 8 ms 14460 KB Output is correct
28 Correct 8 ms 14420 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 8 ms 14420 KB Output is correct
14 Correct 8 ms 14420 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 9 ms 14456 KB Output is correct
18 Correct 8 ms 14456 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14480 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 8 ms 14424 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14420 KB Output is correct
26 Correct 8 ms 14420 KB Output is correct
27 Correct 8 ms 14460 KB Output is correct
28 Correct 8 ms 14420 KB Output is correct
29 Correct 9 ms 14676 KB Output is correct
30 Correct 9 ms 14640 KB Output is correct
31 Correct 10 ms 14700 KB Output is correct
32 Correct 9 ms 14676 KB Output is correct
33 Correct 9 ms 14676 KB Output is correct
34 Correct 9 ms 14736 KB Output is correct
35 Correct 9 ms 14548 KB Output is correct
36 Correct 9 ms 14676 KB Output is correct
37 Correct 9 ms 14640 KB Output is correct
38 Correct 9 ms 14548 KB Output is correct
39 Correct 9 ms 14676 KB Output is correct
40 Correct 9 ms 14548 KB Output is correct
41 Correct 9 ms 14548 KB Output is correct
42 Correct 9 ms 15060 KB Output is correct
43 Correct 9 ms 14804 KB Output is correct
44 Correct 9 ms 14804 KB Output is correct
45 Correct 9 ms 14776 KB Output is correct
46 Correct 9 ms 14676 KB Output is correct
47 Correct 9 ms 14704 KB Output is correct
48 Correct 9 ms 14676 KB Output is correct
49 Correct 9 ms 14608 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 8 ms 14420 KB Output is correct
3 Correct 8 ms 14420 KB Output is correct
4 Correct 8 ms 14420 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 8 ms 14420 KB Output is correct
10 Correct 8 ms 14420 KB Output is correct
11 Correct 8 ms 14420 KB Output is correct
12 Correct 8 ms 14420 KB Output is correct
13 Correct 8 ms 14420 KB Output is correct
14 Correct 8 ms 14420 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 8 ms 14420 KB Output is correct
17 Correct 9 ms 14456 KB Output is correct
18 Correct 8 ms 14456 KB Output is correct
19 Correct 9 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14480 KB Output is correct
22 Correct 8 ms 14420 KB Output is correct
23 Correct 8 ms 14424 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14420 KB Output is correct
26 Correct 8 ms 14420 KB Output is correct
27 Correct 8 ms 14460 KB Output is correct
28 Correct 8 ms 14420 KB Output is correct
29 Correct 9 ms 14676 KB Output is correct
30 Correct 9 ms 14640 KB Output is correct
31 Correct 10 ms 14700 KB Output is correct
32 Correct 9 ms 14676 KB Output is correct
33 Correct 9 ms 14676 KB Output is correct
34 Correct 9 ms 14736 KB Output is correct
35 Correct 9 ms 14548 KB Output is correct
36 Correct 9 ms 14676 KB Output is correct
37 Correct 9 ms 14640 KB Output is correct
38 Correct 9 ms 14548 KB Output is correct
39 Correct 9 ms 14676 KB Output is correct
40 Correct 9 ms 14548 KB Output is correct
41 Correct 9 ms 14548 KB Output is correct
42 Correct 9 ms 15060 KB Output is correct
43 Correct 9 ms 14804 KB Output is correct
44 Correct 9 ms 14804 KB Output is correct
45 Correct 9 ms 14776 KB Output is correct
46 Correct 9 ms 14676 KB Output is correct
47 Correct 9 ms 14704 KB Output is correct
48 Correct 9 ms 14676 KB Output is correct
49 Correct 9 ms 14608 KB Output is correct
50 Correct 208 ms 40512 KB Output is correct
51 Correct 197 ms 40576 KB Output is correct
52 Correct 215 ms 40660 KB Output is correct
53 Correct 198 ms 40496 KB Output is correct
54 Correct 197 ms 40568 KB Output is correct
55 Correct 211 ms 41920 KB Output is correct
56 Correct 170 ms 35752 KB Output is correct
57 Correct 205 ms 42016 KB Output is correct
58 Correct 178 ms 34760 KB Output is correct
59 Correct 207 ms 42032 KB Output is correct
60 Correct 186 ms 34168 KB Output is correct
61 Correct 175 ms 33848 KB Output is correct
62 Correct 244 ms 39748 KB Output is correct
63 Correct 337 ms 36820 KB Output is correct
64 Correct 158 ms 31908 KB Output is correct
65 Correct 293 ms 85448 KB Output is correct
66 Correct 254 ms 62084 KB Output is correct
67 Correct 240 ms 51016 KB Output is correct
68 Correct 249 ms 52576 KB Output is correct
69 Correct 226 ms 47300 KB Output is correct
70 Correct 215 ms 44096 KB Output is correct
71 Correct 119 ms 40908 KB Output is correct
72 Correct 107 ms 37244 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14548 KB Output is correct
2 Correct 9 ms 14548 KB Output is correct
3 Correct 9 ms 14548 KB Output is correct
4 Correct 9 ms 14548 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 8 ms 14524 KB Output is correct
7 Correct 8 ms 14360 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 9 ms 14420 KB Output is correct
10 Correct 9 ms 14420 KB Output is correct
11 Correct 9 ms 14548 KB Output is correct
12 Correct 9 ms 14480 KB Output is correct
13 Correct 9 ms 14420 KB Output is correct
14 Correct 9 ms 14420 KB Output is correct
15 Correct 9 ms 14540 KB Output is correct
16 Correct 9 ms 14544 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 9 ms 14548 KB Output is correct
20 Correct 9 ms 14420 KB Output is correct
21 Correct 9 ms 14424 KB Output is correct
22 Correct 9 ms 14560 KB Output is correct
23 Correct 9 ms 14548 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14548 KB Output is correct
2 Correct 9 ms 14548 KB Output is correct
3 Correct 9 ms 14548 KB Output is correct
4 Correct 9 ms 14548 KB Output is correct
5 Correct 8 ms 14420 KB Output is correct
6 Correct 8 ms 14524 KB Output is correct
7 Correct 8 ms 14360 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 9 ms 14420 KB Output is correct
10 Correct 9 ms 14420 KB Output is correct
11 Correct 9 ms 14548 KB Output is correct
12 Correct 9 ms 14480 KB Output is correct
13 Correct 9 ms 14420 KB Output is correct
14 Correct 9 ms 14420 KB Output is correct
15 Correct 9 ms 14540 KB Output is correct
16 Correct 9 ms 14544 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 9 ms 14548 KB Output is correct
20 Correct 9 ms 14420 KB Output is correct
21 Correct 9 ms 14424 KB Output is correct
22 Correct 9 ms 14560 KB Output is correct
23 Correct 9 ms 14548 KB Output is correct
24 Correct 103 ms 24600 KB Output is correct
25 Correct 108 ms 24608 KB Output is correct
26 Correct 101 ms 24644 KB Output is correct
27 Correct 101 ms 24648 KB Output is correct
28 Correct 101 ms 24656 KB Output is correct
29 Correct 105 ms 24472 KB Output is correct
30 Correct 96 ms 25156 KB Output is correct
31 Correct 104 ms 24524 KB Output is correct
32 Correct 95 ms 25328 KB Output is correct
33 Correct 120 ms 24520 KB Output is correct
34 Correct 167 ms 25308 KB Output is correct
35 Correct 72 ms 25140 KB Output is correct
36 Correct 97 ms 24820 KB Output is correct
37 Correct 108 ms 24588 KB Output is correct
38 Correct 97 ms 25312 KB Output is correct
39 Correct 116 ms 35372 KB Output is correct
40 Correct 112 ms 29884 KB Output is correct
41 Correct 103 ms 28096 KB Output is correct
42 Correct 102 ms 27072 KB Output is correct
43 Correct 105 ms 25792 KB Output is correct
44 Correct 109 ms 25540 KB Output is correct
45 Correct 79 ms 24384 KB Output is correct
46 Correct 75 ms 24384 KB Output is correct