oj.uz

Submission #794312

# Submission time Handle Problem Language Result Execution time Memory
794312 2023-07-26T12:26:58 Z flappybird Travelling Trader (CCO23_day2problem2) C++17
25 / 25
 233 ms 81604 KB 
#include <bits/stdc++.h>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 202300
#define MAXS 20
#define INF 100000000000000001
#define bb ' '
#define ln '\n'
#define Ln '\n'
int C[MAX];
vector<int> adj[MAX];
int N, K;
namespace k1 {
	ll sum[MAX];
	int mv[MAX];
	void dfs(int x, int p = 0) {
		sum[x] = C[x];
		for (auto v : adj[x]) if (v != p) {
			dfs(v, x);
			if (sum[v] > sum[mv[x]]) mv[x] = v;
		}
		sum[x] += sum[mv[x]];
	}
	void solve() {
		dfs(1);
		vector<int> ansv;
		int v = 1;
		ll ans = 0;
		while (1) {
			ansv.push_back(v);
			ans += C[v];
			v = mv[v];
			if (!v) break;
		}
		cout << ans << ln;
		cout << ansv.size() << ln;
		for (auto v : ansv) cout << v << bb;
	}
}
namespace k2 {
	typedef pair<ll, int> pli;
	ll dp[MAX];
	ll end[2][MAX];
	int dpath[MAX]; // dp path
	pii epath[MAX]; // end path
	int chk[MAX];
	int e1path[MAX][3];
	// 0 : child -> calc(c) -> another calc(c) -> down(c, 0)
	// 1 : child -> calc(c) -> down(c, 1)
	const int DEBUG = 0;
	int sp[MAX][MAXS];
	int dep[MAX] = { 0, 1 };
	void dfs(int x, int p = 0) {
		if (DEBUG) {
			sp[x][0] = p;
			int i;
			for (i = 1; i < MAXS; i++) sp[x][i] = sp[sp[x][i - 1]][i - 1];
		}
		pli me[3]; //max end
		pli me1[3]; //max end
		pli md[3]; //max dp
		int i, j, k;
		for (i = 0; i < 3; i++) me1[i] = me[i] = md[i] = pli(-INF, -1);
		dp[x] += C[x];
		end[0][x] += C[x];
		end[1][x] += C[x];
		if (p && adj[x].size() == 1) {
			end[1][x] = -INF;
			return;
		}
		int pv = 0;
		pli mme1 = pli(-INF, -1);
		for (auto v : adj[x]) if (v != p) {
			pv = v;
			if (DEBUG) dep[v] = dep[x] + 1;
			dfs(v, x);
			dp[x] += C[v];
			end[0][x] += C[v];
			end[1][x] += C[v];
			pli d = pli(dp[v] - C[v], v);
			pli e = pli(end[0][v] - C[v], v);
			pli e1 = pli(end[1][v] - C[v], v);
			me[2] = max(me[2], e);
			md[2] = max(md[2], d);
			me1[2] = max(me1[2], e1);
			mme1 = max(mme1, pli(end[1][v], v));
			for (i = 2; i >= 1; i--) if (me[i] > me[i - 1]) swap(me[i], me[i - 1]);
			for (i = 2; i >= 1; i--) if (me1[i] > me1[i - 1]) swap(me1[i], me1[i - 1]);
			for (i = 2; i >= 1; i--) if (md[i] > md[i - 1]) swap(md[i], md[i - 1]);
		}
		dpath[x] = md[0].second;
		dp[x] += md[0].first;
		epath[x].second = pv;
		int c = 0;
		if (p && adj[x].size() <= 2) c = 1;
		if (!p && adj[x].size() == 1) c = 1;
		if (c) {
			end[0][x] += me[0].first;
			if (end[0][x] < end[1][pv] + C[x]) {
				epath[x] = pii(-1, pv);
				end[0][x] = end[1][pv] + C[x];
			}
			end[1][x] = -INF;
			return;
		}
		ll mx = -INF;
		if (md[0].second != me[0].second) {
			mx = md[0].first + me[0].first;
			epath[x] = pii(md[0].second, me[0].second);
		}
		else {
			if (mx < md[0].first + me[1].first) {
				mx = md[0].first + me[1].first;
				epath[x] = pii(md[0].second, me[1].second);
				assert(md[0].second != me[1].second);
			}
			if (mx < md[1].first + me[0].first) {
				mx = md[1].first + me[0].first;
				epath[x] = pii(md[1].second, me[0].second);
				assert(md[1].second != me[0].second);
			}
		}
		//check mme1
		if (end[0][x] + mx < mme1.first + C[x]) {
			end[0][x] = mme1.first + C[x];
			epath[x] = pii(-1, mme1.second);
		}
		else end[0][x] += mx;
		mx = -INF;
		for (i = 0; i < 3; i++) for (j = i + 1; j < 3; j++) {
			if (!~me[i].second) continue;
			if (!~me[j].second) continue;
			for (k = 0; k < 3; k++) {
				if (!~me[k].second) continue;
				if (me[k].second == md[i].second) continue;
				if (me[k].second == md[j].second) continue;
				ll sum = me[k].first + md[i].first + md[j].first;
				if (mx < sum) {
					mx = sum;
					e1path[x][0] = md[i].second;
					e1path[x][1] = md[j].second;
					e1path[x][2] = me[k].second;
				}
			}
		}
		for (i = 0; i < 2; i++) {
			if (!~md[i].second) continue;
			for (j = 0; j < 2; j++) {
				if (!~me1[j].second) continue;
				if (md[i].second == me1[j].second) continue;
				ll sum = md[i].first + me1[j].first;
				if (mx < sum) {
					mx = sum;
					chk[x] = 1;
					e1path[x][0] = md[i].second;
					e1path[x][1] = me1[j].second;
				}
			}
		}
		end[1][x] += mx;
	}
	inline int lca(int u, int v) {
		int i;
		if (dep[u] != dep[v]) {
			if (dep[u] > dep[v]) swap(u, v);
			int d = dep[v] - dep[u];
			for (i = 0; i < MAXS; i++) if (d >> i & 1) v = sp[v][i];
		}
		if (u == v) return u;
		for (i = MAXS - 1; i >= 0; i--) if (sp[u][i] != sp[v][i]) u = sp[u][i], v = sp[v][i];
		return sp[u][0];
	}
	int dis(int u, int v) {
		return dep[u] + dep[v] - 2 * dep[lca(u, v)];
	}
	vector<int> ansv;
	ll sum = 0;
	void calc(int x, int c, int p = 0) {
		if (adj[x].size() == 1) {
			ansv.push_back(x);
			sum += C[x];
			return;
		}
		if (!c) ansv.push_back(x), calc(dpath[x], c ^ 1, x), sum += C[x];
		for (auto v : adj[x]) if (v != p && dpath[x] != v) ansv.push_back(v), sum += C[v];
		if (c) calc(dpath[x], c ^ 1, x), ansv.push_back(x), sum += C[x];
	}
	void down(int x, int c, int p = 0) {
		if (!c) {
			ansv.push_back(x);
			sum += C[x];
			if (p && adj[x].size() == 1) return;
			if (!~epath[x].first) {
				down(epath[x].second, 1, x);
				return;
			}
			if (epath[x].first) calc(epath[x].first, 1, x);
			for (auto v : adj[x]) if (v != p) {
				if (v == epath[x].first) continue;
				if (v == epath[x].second) continue;
				ansv.push_back(v);
				sum += C[v];
			}
			down(epath[x].second, 0, x);
		}
		else {
			assert(adj[x].size() > 2);
			for (auto v : adj[x]) if (v != p) {
				if (v == e1path[x][0]) continue;
				if (v == e1path[x][1]) continue;
				if (v == e1path[x][2]) continue;
				ansv.push_back(v);
				sum += C[v];
			}
			calc(e1path[x][0], 0, x);
			ansv.push_back(x);
			sum += C[x];
			if (chk[x]) down(e1path[x][1], 1, x);
			else {
				calc(e1path[x][1], 1, x);
				down(e1path[x][2], 0, x);
			}
		}
	}
	void solve() {
		dfs(1);
		down(1, 0);
		cout << sum << ln;
		cout << ansv.size() << ln;
		for (auto v : ansv) cout << v << bb;
		int i;
		for (i = 1; i < ansv.size(); i++) {
			if (DEBUG) cout << i << ln;
			assert(dis(ansv[i], ansv[i - 1]) <= 2);
		}
		vector<int> cpy = ansv;
		sort(cpy.begin(), cpy.end());
		cpy.erase(unique(cpy.begin(), cpy.end()), cpy.end());
		assert(cpy.size() == ansv.size());
		ll asdfsum = 0;
		for (auto v : ansv) asdfsum += C[v];
		assert(asdfsum == end[0][1]);
	}
}
namespace k3 {
	vector<int> ansv;
	void dfs(int x, int c, int p = 0) {
		if (c) ansv.push_back(x);
		for (auto v : adj[x]) if (v != p) dfs(v, c ^ 1, x);
		if (!c) ansv.push_back(x);
	}
	void solve() {
		ll sum = 0;
		int i;
		for (i = 1; i <= N; i++) sum += C[i];
		dfs(1, 1);
		cout << sum << ln;
		cout << N << Ln;
		for (auto v : ansv) cout << v << bb;
	}
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> N >> K;
	int i, a, b;
	for (i = 1; i < N; i++) {
		cin >> a >> b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	for (i = 1; i <= N; i++) cin >> C[i];
	if (K == 1) k1::solve();
	if (K == 2) k2::solve();
	if (K == 3) k3::solve();
}

Compilation message

Main.cpp: In function 'void k2::solve()':
Main.cpp:239:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  239 |   for (i = 1; i < ansv.size(); i++) {
      |               ~~^~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 93 ms 14700 KB Output is correct
4 Correct 87 ms 14668 KB Output is correct
5 Correct 93 ms 14496 KB Output is correct
6 Correct 86 ms 15244 KB Output is correct
7 Correct 56 ms 14460 KB Output is correct
8 Correct 73 ms 14804 KB Output is correct
9 Correct 134 ms 35412 KB Output is correct
10 Correct 108 ms 25000 KB Output is correct
11 Correct 59 ms 14028 KB Output is correct
12 Correct 2 ms 5076 KB Output is correct

Subtask #2
7.0 / 7.0

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

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 2 ms 5076 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 2 ms 5076 KB Output is correct
7 Correct 3 ms 5096 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 2 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 2 ms 5076 KB Output is correct
12 Correct 2 ms 5076 KB Output is correct
13 Correct 2 ms 5124 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 2 ms 5076 KB Output is correct
18 Correct 2 ms 5076 KB Output is correct
19 Correct 2 ms 5076 KB Output is correct
20 Correct 3 ms 5100 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 2 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 2 ms 5076 KB Output is correct
25 Correct 2 ms 5076 KB Output is correct
26 Correct 2 ms 5076 KB Output is correct
27 Correct 2 ms 5076 KB Output is correct
28 Correct 2 ms 5076 KB Output is correct
29 Correct 3 ms 5204 KB Output is correct
30 Correct 3 ms 5204 KB Output is correct
31 Correct 3 ms 5204 KB Output is correct
32 Correct 3 ms 5204 KB Output is correct
33 Correct 3 ms 5204 KB Output is correct
34 Correct 3 ms 5332 KB Output is correct
35 Correct 3 ms 5204 KB Output is correct
36 Correct 3 ms 5332 KB Output is correct
37 Correct 3 ms 5332 KB Output is correct
38 Correct 3 ms 5204 KB Output is correct
39 Correct 3 ms 5204 KB Output is correct
40 Correct 8 ms 5304 KB Output is correct
41 Correct 3 ms 5204 KB Output is correct
42 Correct 4 ms 5844 KB Output is correct
43 Correct 3 ms 5588 KB Output is correct
44 Correct 3 ms 5460 KB Output is correct
45 Correct 3 ms 5460 KB Output is correct
46 Correct 3 ms 5400 KB Output is correct
47 Correct 3 ms 5388 KB Output is correct
48 Correct 3 ms 5204 KB Output is correct
49 Correct 3 ms 5204 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 2 ms 5076 KB Output is correct
3 Correct 2 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 2 ms 5076 KB Output is correct
7 Correct 3 ms 5096 KB Output is correct
8 Correct 3 ms 5076 KB Output is correct
9 Correct 2 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 2 ms 5076 KB Output is correct
12 Correct 2 ms 5076 KB Output is correct
13 Correct 2 ms 5124 KB Output is correct
14 Correct 2 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 2 ms 5076 KB Output is correct
18 Correct 2 ms 5076 KB Output is correct
19 Correct 2 ms 5076 KB Output is correct
20 Correct 3 ms 5100 KB Output is correct
21 Correct 3 ms 5076 KB Output is correct
22 Correct 2 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 2 ms 5076 KB Output is correct
25 Correct 2 ms 5076 KB Output is correct
26 Correct 2 ms 5076 KB Output is correct
27 Correct 2 ms 5076 KB Output is correct
28 Correct 2 ms 5076 KB Output is correct
29 Correct 3 ms 5204 KB Output is correct
30 Correct 3 ms 5204 KB Output is correct
31 Correct 3 ms 5204 KB Output is correct
32 Correct 3 ms 5204 KB Output is correct
33 Correct 3 ms 5204 KB Output is correct
34 Correct 3 ms 5332 KB Output is correct
35 Correct 3 ms 5204 KB Output is correct
36 Correct 3 ms 5332 KB Output is correct
37 Correct 3 ms 5332 KB Output is correct
38 Correct 3 ms 5204 KB Output is correct
39 Correct 3 ms 5204 KB Output is correct
40 Correct 8 ms 5304 KB Output is correct
41 Correct 3 ms 5204 KB Output is correct
42 Correct 4 ms 5844 KB Output is correct
43 Correct 3 ms 5588 KB Output is correct
44 Correct 3 ms 5460 KB Output is correct
45 Correct 3 ms 5460 KB Output is correct
46 Correct 3 ms 5400 KB Output is correct
47 Correct 3 ms 5388 KB Output is correct
48 Correct 3 ms 5204 KB Output is correct
49 Correct 3 ms 5204 KB Output is correct
50 Correct 123 ms 22604 KB Output is correct
51 Correct 121 ms 22536 KB Output is correct
52 Correct 118 ms 22572 KB Output is correct
53 Correct 119 ms 22568 KB Output is correct
54 Correct 119 ms 22540 KB Output is correct
55 Correct 124 ms 22432 KB Output is correct
56 Correct 101 ms 22348 KB Output is correct
57 Correct 123 ms 22592 KB Output is correct
58 Correct 97 ms 22440 KB Output is correct
59 Correct 126 ms 22544 KB Output is correct
60 Correct 98 ms 22528 KB Output is correct
61 Correct 104 ms 20668 KB Output is correct
62 Correct 120 ms 21180 KB Output is correct
63 Correct 113 ms 22600 KB Output is correct
64 Correct 85 ms 20840 KB Output is correct
65 Correct 233 ms 81604 KB Output is correct
66 Correct 200 ms 55076 KB Output is correct
67 Correct 170 ms 40372 KB Output is correct
68 Correct 177 ms 40200 KB Output is correct
69 Correct 211 ms 32040 KB Output is correct
70 Correct 166 ms 30344 KB Output is correct
71 Correct 68 ms 18828 KB Output is correct
72 Correct 69 ms 18448 KB Output is correct

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 2 ms 5076 KB Output is correct
8 Correct 2 ms 5076 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5176 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5204 KB Output is correct
18 Correct 3 ms 5204 KB Output is correct
19 Correct 3 ms 5076 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5204 KB Output is correct
22 Correct 3 ms 5204 KB Output is correct
23 Correct 3 ms 5204 KB Output is correct
24 Correct 97 ms 14524 KB Output is correct
25 Correct 111 ms 14536 KB Output is correct
26 Correct 123 ms 14444 KB Output is correct
27 Correct 104 ms 14536 KB Output is correct
28 Correct 99 ms 14536 KB Output is correct
29 Correct 102 ms 14392 KB Output is correct
30 Correct 93 ms 15032 KB Output is correct
31 Correct 102 ms 14384 KB Output is correct
32 Correct 104 ms 15180 KB Output is correct
33 Correct 110 ms 14364 KB Output is correct
34 Correct 91 ms 15168 KB Output is correct
35 Correct 72 ms 15036 KB Output is correct
36 Correct 83 ms 14636 KB Output is correct
37 Correct 90 ms 14416 KB Output is correct
38 Correct 85 ms 15168 KB Output is correct
39 Correct 113 ms 21208 KB Output is correct
40 Correct 115 ms 17812 KB Output is correct
41 Correct 101 ms 17008 KB Output is correct
42 Correct 98 ms 16028 KB Output is correct
43 Correct 102 ms 15164 KB Output is correct
44 Correct 94 ms 14944 KB Output is correct
45 Correct 75 ms 14272 KB Output is correct
46 Correct 69 ms 14272 KB Output is correct