oj.uz

Submission #793688

# Submission time Handle Problem Language Result Execution time Memory
793688 2023-07-26T05:33:10 Z 곰(#10095) Travelling Trader (CCO23_day2problem2) C++17
11 / 25
 180 ms 50984 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],S;
vector<int> g[N],c[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){
		c[u].emplace_back(v);
		dfs2(v,u);
		s[u]+=a[v];
	}
	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][0]+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][2]+dp[x][0]+s[u]-a[v]-a[w]-a[x]);
			}
		}
	}
	dp[u][3]=max(dp[u][3],dp[u][0]);
	//debug(u,dp[u][0],dp[u][1],dp[u][2],dp[u][3]);
}
void track2(int u,int d){
	debug(u,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: c[u]) if(v!=w) ans.emplace_back(w);
			track2(v,0);
			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: c[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: c[u]) if(v!=w) ans.emplace_back(w);
			track2(v,2);
			ans.emplace_back(u);
			return;
		}
	} 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: c[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][0]+s[u]-a[v]-a[w]){
					track2(v,2);
					ans.emplace_back(u);
					for(int x: c[u]) if(v!=x&&w!=x) ans.emplace_back(x);
					track2(w,0);
					return;
				}
				for(int x: c[u]) if(v!=x&&w!=x){
					if(dp[u][3]==dp[v][2]+dp[w][2]+dp[x][0]+s[u]-a[v]-a[w]-a[x]){
						track2(v,2);
						ans.emplace_back(u);
						track2(w,2);
						for(int y: c[u]) if(v!=x&&w!=x&&y!=x) ans.emplace_back(y);
						track2(x,0);
					}
				}
			}
		}
	}
}
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);
		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:63:2: note: in expansion of macro 'debug'
   63 |  debug(u,d);
      |  ^~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 6 ms 9812 KB Output is correct
3 Correct 150 ms 27252 KB Output is correct
4 Correct 127 ms 27176 KB Output is correct
5 Correct 125 ms 27704 KB Output is correct
6 Correct 101 ms 26188 KB Output is correct
7 Correct 70 ms 26136 KB Output is correct
8 Correct 108 ms 27644 KB Output is correct
9 Correct 180 ms 50984 KB Output is correct
10 Correct 157 ms 37500 KB Output is correct
11 Correct 71 ms 26840 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Runtime error 13 ms 19468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Runtime error 13 ms 19468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Runtime error 13 ms 19468 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9812 KB Output is correct
2 Correct 6 ms 9812 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Correct 6 ms 9812 KB Output is correct
5 Correct 6 ms 9812 KB Output is correct
6 Correct 6 ms 9780 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9812 KB Output is correct
10 Correct 6 ms 9812 KB Output is correct
11 Correct 7 ms 9812 KB Output is correct
12 Correct 6 ms 9812 KB Output is correct
13 Correct 6 ms 9812 KB Output is correct
14 Correct 6 ms 9764 KB Output is correct
15 Correct 6 ms 9824 KB Output is correct
16 Correct 6 ms 9836 KB Output is correct
17 Correct 6 ms 9812 KB Output is correct
18 Correct 6 ms 9784 KB Output is correct
19 Correct 6 ms 9784 KB Output is correct
20 Correct 6 ms 9812 KB Output is correct
21 Correct 6 ms 9812 KB Output is correct
22 Correct 6 ms 9940 KB Output is correct
23 Correct 6 ms 9812 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9812 KB Output is correct
2 Correct 6 ms 9812 KB Output is correct
3 Correct 5 ms 9812 KB Output is correct
4 Correct 6 ms 9812 KB Output is correct
5 Correct 6 ms 9812 KB Output is correct
6 Correct 6 ms 9780 KB Output is correct
7 Correct 6 ms 9684 KB Output is correct
8 Correct 5 ms 9684 KB Output is correct
9 Correct 6 ms 9812 KB Output is correct
10 Correct 6 ms 9812 KB Output is correct
11 Correct 7 ms 9812 KB Output is correct
12 Correct 6 ms 9812 KB Output is correct
13 Correct 6 ms 9812 KB Output is correct
14 Correct 6 ms 9764 KB Output is correct
15 Correct 6 ms 9824 KB Output is correct
16 Correct 6 ms 9836 KB Output is correct
17 Correct 6 ms 9812 KB Output is correct
18 Correct 6 ms 9784 KB Output is correct
19 Correct 6 ms 9784 KB Output is correct
20 Correct 6 ms 9812 KB Output is correct
21 Correct 6 ms 9812 KB Output is correct
22 Correct 6 ms 9940 KB Output is correct
23 Correct 6 ms 9812 KB Output is correct
24 Correct 109 ms 19968 KB Output is correct
25 Correct 98 ms 19912 KB Output is correct
26 Correct 98 ms 19912 KB Output is correct
27 Correct 98 ms 19912 KB Output is correct
28 Correct 99 ms 19912 KB Output is correct
29 Correct 100 ms 19800 KB Output is correct
30 Correct 93 ms 20424 KB Output is correct
31 Correct 101 ms 19788 KB Output is correct
32 Correct 108 ms 20696 KB Output is correct
33 Correct 123 ms 19832 KB Output is correct
34 Correct 95 ms 20672 KB Output is correct
35 Correct 74 ms 20544 KB Output is correct
36 Correct 89 ms 20092 KB Output is correct
37 Correct 91 ms 19852 KB Output is correct
38 Correct 93 ms 20660 KB Output is correct
39 Correct 141 ms 30608 KB Output is correct
40 Correct 122 ms 25232 KB Output is correct
41 Correct 99 ms 23324 KB Output is correct
42 Correct 104 ms 22368 KB Output is correct
43 Correct 98 ms 21036 KB Output is correct
44 Correct 105 ms 20800 KB Output is correct
45 Correct 77 ms 19684 KB Output is correct
46 Correct 76 ms 19672 KB Output is correct