oj.uz

Submission #794350

# Submission time Handle Problem Language Result Execution time Memory
794350 2023-07-26T13:07:05 Z 곰(#10095) Travelling Trader (CCO23_day2problem2) C++17
25 / 25
 287 ms 85416 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: c[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: c[u]) for(int w: c[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: c[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: c[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: c[u]){
			for(int w: c[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: c[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 14308 KB Output is correct
2 Correct 9 ms 14420 KB Output is correct
3 Correct 126 ms 31840 KB Output is correct
4 Correct 124 ms 31876 KB Output is correct
5 Correct 136 ms 32468 KB Output is correct
6 Correct 125 ms 31056 KB Output is correct
7 Correct 71 ms 30812 KB Output is correct
8 Correct 105 ms 32320 KB Output is correct
9 Correct 176 ms 55704 KB Output is correct
10 Correct 167 ms 42160 KB Output is correct
11 Correct 75 ms 31608 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 14392 KB Output is correct
2 Correct 8 ms 14400 KB Output is correct
3 Correct 9 ms 14460 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 14396 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 14456 KB Output is correct
14 Correct 8 ms 14420 KB Output is correct
15 Correct 8 ms 14424 KB Output is correct
16 Correct 8 ms 14392 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 8 ms 14432 KB Output is correct
23 Correct 10 ms 14368 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14376 KB Output is correct
26 Correct 8 ms 14420 KB Output is correct
27 Correct 8 ms 14420 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 14392 KB Output is correct
2 Correct 8 ms 14400 KB Output is correct
3 Correct 9 ms 14460 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 14396 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 14456 KB Output is correct
14 Correct 8 ms 14420 KB Output is correct
15 Correct 8 ms 14424 KB Output is correct
16 Correct 8 ms 14392 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 8 ms 14432 KB Output is correct
23 Correct 10 ms 14368 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14376 KB Output is correct
26 Correct 8 ms 14420 KB Output is correct
27 Correct 8 ms 14420 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 14676 KB Output is correct
31 Correct 9 ms 14656 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 14712 KB Output is correct
35 Correct 9 ms 14656 KB Output is correct
36 Correct 9 ms 14684 KB Output is correct
37 Correct 9 ms 14548 KB Output is correct
38 Correct 9 ms 14544 KB Output is correct
39 Correct 9 ms 14676 KB Output is correct
40 Correct 11 ms 14592 KB Output is correct
41 Correct 9 ms 14592 KB Output is correct
42 Correct 9 ms 15156 KB Output is correct
43 Correct 9 ms 14804 KB Output is correct
44 Correct 10 ms 14804 KB Output is correct
45 Correct 9 ms 14784 KB Output is correct
46 Correct 9 ms 14656 KB Output is correct
47 Correct 9 ms 14676 KB Output is correct
48 Correct 10 ms 14604 KB Output is correct
49 Correct 9 ms 14548 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14392 KB Output is correct
2 Correct 8 ms 14400 KB Output is correct
3 Correct 9 ms 14460 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 14396 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 14456 KB Output is correct
14 Correct 8 ms 14420 KB Output is correct
15 Correct 8 ms 14424 KB Output is correct
16 Correct 8 ms 14392 KB Output is correct
17 Correct 8 ms 14420 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14420 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 8 ms 14432 KB Output is correct
23 Correct 10 ms 14368 KB Output is correct
24 Correct 8 ms 14420 KB Output is correct
25 Correct 8 ms 14376 KB Output is correct
26 Correct 8 ms 14420 KB Output is correct
27 Correct 8 ms 14420 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 14676 KB Output is correct
31 Correct 9 ms 14656 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 14712 KB Output is correct
35 Correct 9 ms 14656 KB Output is correct
36 Correct 9 ms 14684 KB Output is correct
37 Correct 9 ms 14548 KB Output is correct
38 Correct 9 ms 14544 KB Output is correct
39 Correct 9 ms 14676 KB Output is correct
40 Correct 11 ms 14592 KB Output is correct
41 Correct 9 ms 14592 KB Output is correct
42 Correct 9 ms 15156 KB Output is correct
43 Correct 9 ms 14804 KB Output is correct
44 Correct 10 ms 14804 KB Output is correct
45 Correct 9 ms 14784 KB Output is correct
46 Correct 9 ms 14656 KB Output is correct
47 Correct 9 ms 14676 KB Output is correct
48 Correct 10 ms 14604 KB Output is correct
49 Correct 9 ms 14548 KB Output is correct
50 Correct 192 ms 40560 KB Output is correct
51 Correct 188 ms 40572 KB Output is correct
52 Correct 187 ms 40584 KB Output is correct
53 Correct 187 ms 40456 KB Output is correct
54 Correct 206 ms 40464 KB Output is correct
55 Correct 203 ms 41816 KB Output is correct
56 Correct 173 ms 35780 KB Output is correct
57 Correct 201 ms 41916 KB Output is correct
58 Correct 167 ms 34660 KB Output is correct
59 Correct 202 ms 41936 KB Output is correct
60 Correct 166 ms 34144 KB Output is correct
61 Correct 173 ms 33808 KB Output is correct
62 Correct 202 ms 39836 KB Output is correct
63 Correct 180 ms 36704 KB Output is correct
64 Correct 159 ms 31960 KB Output is correct
65 Correct 287 ms 85416 KB Output is correct
66 Correct 287 ms 61996 KB Output is correct
67 Correct 242 ms 51060 KB Output is correct
68 Correct 243 ms 52520 KB Output is correct
69 Correct 236 ms 47392 KB Output is correct
70 Correct 213 ms 44132 KB Output is correct
71 Correct 113 ms 40896 KB Output is correct
72 Correct 102 ms 37344 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14556 KB Output is correct
2 Correct 9 ms 14548 KB Output is correct
3 Correct 8 ms 14432 KB Output is correct
4 Correct 9 ms 14548 KB Output is correct
5 Correct 9 ms 14460 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 9 ms 14420 KB Output is correct
11 Correct 9 ms 14540 KB Output is correct
12 Correct 9 ms 14420 KB Output is correct
13 Correct 9 ms 14420 KB Output is correct
14 Correct 8 ms 14540 KB Output is correct
15 Correct 9 ms 14548 KB Output is correct
16 Correct 9 ms 14420 KB Output is correct
17 Correct 8 ms 14548 KB Output is correct
18 Correct 11 ms 14516 KB Output is correct
19 Correct 11 ms 14420 KB Output is correct
20 Correct 9 ms 14436 KB Output is correct
21 Correct 8 ms 14432 KB Output is correct
22 Correct 9 ms 14548 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 11 ms 14556 KB Output is correct
2 Correct 9 ms 14548 KB Output is correct
3 Correct 8 ms 14432 KB Output is correct
4 Correct 9 ms 14548 KB Output is correct
5 Correct 9 ms 14460 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 9 ms 14420 KB Output is correct
11 Correct 9 ms 14540 KB Output is correct
12 Correct 9 ms 14420 KB Output is correct
13 Correct 9 ms 14420 KB Output is correct
14 Correct 8 ms 14540 KB Output is correct
15 Correct 9 ms 14548 KB Output is correct
16 Correct 9 ms 14420 KB Output is correct
17 Correct 8 ms 14548 KB Output is correct
18 Correct 11 ms 14516 KB Output is correct
19 Correct 11 ms 14420 KB Output is correct
20 Correct 9 ms 14436 KB Output is correct
21 Correct 8 ms 14432 KB Output is correct
22 Correct 9 ms 14548 KB Output is correct
23 Correct 9 ms 14548 KB Output is correct
24 Correct 111 ms 24664 KB Output is correct
25 Correct 100 ms 24648 KB Output is correct
26 Correct 99 ms 24648 KB Output is correct
27 Correct 97 ms 24564 KB Output is correct
28 Correct 103 ms 24648 KB Output is correct
29 Correct 101 ms 24520 KB Output is correct
30 Correct 96 ms 25140 KB Output is correct
31 Correct 122 ms 24436 KB Output is correct
32 Correct 94 ms 25284 KB Output is correct
33 Correct 107 ms 24520 KB Output is correct
34 Correct 95 ms 25408 KB Output is correct
35 Correct 74 ms 25152 KB Output is correct
36 Correct 88 ms 24768 KB Output is correct
37 Correct 92 ms 24648 KB Output is correct
38 Correct 91 ms 25292 KB Output is correct
39 Correct 122 ms 35392 KB Output is correct
40 Correct 127 ms 29888 KB Output is correct
41 Correct 110 ms 28076 KB Output is correct
42 Correct 101 ms 27072 KB Output is correct
43 Correct 101 ms 25744 KB Output is correct
44 Correct 114 ms 25516 KB Output is correct
45 Correct 74 ms 24384 KB Output is correct
46 Correct 71 ms 24368 KB Output is correct