oj.uz

Submission #882969

# Submission time Handle Problem Language Result Execution time Memory
882969 2023-12-04T09:37:12 Z tsumondai Travelling Trader (CCO23_day2problem2) C++14
25 / 25
 333 ms 127692 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME  (1.0 * clock() / CLOCKS_PER_SEC)

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, ii> iiii;

const int N = 1e6 + 5;

const int oo = 1e18, mod = 1e9 + 7;

int n, m, k, a[N];
vector<int> edges[N];


namespace subtask1 {

ii dist[N];

void dfs(int u, int par) {
	dist[u] = {0, u};
	for (int v : edges[u]) {
		if (v == par) continue;
		dfs(v, u);
		dist[u] = max(dist[u], {dist[v].fi, v});
	}
	dist[u].fi += a[u];
}

void process() {
	dfs(1, 0);
	cout << dist[1].fi << '\n';
	vector<int> res;
	int u = 1; res.push_back(u);
	while (dist[u].se != u) {
		u = dist[u].se;
		res.push_back(u);
	}
	cout << (int)res.size() << '\n';
	for (int v : res) cout << v << (v == res.back() ? '\n' : ' ');
}

}
namespace subtask2 {
int dp[N][2][2];
iii trace[N][2][2];
vector<int> res;

void dfs(int u, int par) {
	int total = 0;
	for (int v : edges[u]) {
		if (v == par) continue;
		dfs(v, u); total += a[v];
	}
	{	ii Max = {0, 0};
		for (int v : edges[u]) {
			if (v == par) continue;
			Max = max(Max, {dp[v][1][1] + total, v});
		}
		dp[u][0][1] = Max.fi;
		trace[u][0][1] = {Max.se, {0, 0}};
	}
	{	ii Max = {0, 0};
		for (int v : edges[u]) {
			if (v == par) continue;
			Max = max(Max, {dp[v][0][1] + total, v});
		}
		dp[u][1][1] = Max.fi;
		trace[u][1][1] = {Max.se, {0, 0}};
	}
	{	iii Max = {0, {0, 0}};
		vector<ii> p1 = {{0, 0}}, p2 = {{0, 0}};
		for (int v : edges[u]) {
			if (v == par) continue;
			Max = max(Max, {dp[v][1][0] + a[v], { -1, v}});
			p1.push_back({dp[v][1][1], v});
			p2.push_back({dp[v][0][0], v});
		}
		sort(p1.begin(), p1.end(), greater<ii>());
		sort(p2.begin(), p2.end(), greater<ii>());
		for (int i = 0; i < min(2LL, (int)p1.size()); i++)
			for (int j = 0; j < min(2LL, (int)p2.size()); j++) {
				if (p2[j].se != 0 && p2[j].se == p1[i].se) continue;
				Max = max(Max, {p1[i].fi + p2[j].fi + total, {p1[i].se, p2[j].se}});
			}
		dp[u][0][0] = Max.fi;
		trace[u][0][0] = {Max.se.fi, {Max.se.se, 0}};
	}
	{	pair<int, iii> Max = {0, {0, {0, 0}}};
		{
			iii Max2 = {0, {0, 0}};
			vector<ii> p1 = {{0, 0}}, p2 = {{0, 0}};
			for (int v : edges[u]) {
				if (v == par) continue;
				p1.push_back({dp[v][0][1], v});
				p2.push_back({dp[v][1][0], v});
			}
			sort(p1.begin(), p1.end(), greater<ii>());
			sort(p2.begin(), p2.end(), greater<ii>());
			for (int i = 0; i < min(2LL, (int)p1.size()); i++)
				for (int j = 0; j < min(2LL, (int)p2.size()); j++) {
					if (p2[j].se != 0 && p2[j].se == p1[i].se) continue;
					Max2 = max(Max2, {p1[i].fi + p2[j].fi + total, {p1[i].se, p2[j].se}});
				}
			Max = max(Max, {Max2.fi, { -1, Max2.se}});
		}

		vector<ii> p1 = {{0, 0}}, p2 = {{0, 0}}, p3 = {{0, 0}};
		for (int v : edges[u]) {
			if (v == par) continue;
			p1.push_back({dp[v][0][1], v});
			p2.push_back({dp[v][1][1], v});
			p3.push_back({dp[v][0][0], v});
		}
		sort(p1.begin(), p1.end(), greater<ii>());
		sort(p2.begin(), p2.end(), greater<ii>());
		sort(p3.begin(), p3.end(), greater<ii>());
		for (int i = 0; i < min(3LL, (int)p1.size()); i++)
			for (int j = 0; j < min(3LL, (int)p2.size()); j++)
				for (int k = 0; k < min(3LL, (int)p3.size()); k++) {
					if (p2[j].se != 0 && p2[j].se == p1[i].se) continue;
					if (p3[k].se != 0 && (p3[k].se == p1[i].se || p3[k].se == p2[j].se)) continue;
					Max = max(Max, {p1[i].fi + p2[j].fi + p3[k].fi + total, {p1[i].se, {p2[j].se, p3[k].se}}});
				}
		dp[u][1][0] = Max.fi;
		trace[u][1][0] = Max.se;
	}
}

void f(int u, int par, int t1, int t2) {
	if (!t1 && t2) {
		res.push_back(u);
		if (trace[u][0][1].fi) f(trace[u][0][1].fi, u, 1, 1);
		for (int v : edges[u]) {
			if (v == par) continue;
			if (v == trace[u][0][1].fi) continue;
			res.push_back(v);
		}
	}
	else if (t1 && t2) {
		for (int v : edges[u]) {
			if (v == par) continue;
			if (v == trace[u][1][1].fi) continue;
			res.push_back(v);
		}
		if (trace[u][1][1].fi) f(trace[u][1][1].fi, u, 0, 1);
		res.push_back(u);
	}
	else if (!t1 && !t2) {
		res.push_back(u);
		if (trace[u][0][0].fi == -1) {
			if (trace[u][0][0].se.fi) f(trace[u][0][0].se.fi, u, 1, 0);
			return;
		}
		if (trace[u][0][0].fi) f(trace[u][0][0].fi, u, 1, 1);
		for (int v : edges[u]) {
			if (v == par) continue;
			if (v == trace[u][0][0].se.fi || v == trace[u][0][0].fi) continue;
			res.push_back(v);
		}
		if (trace[u][0][0].se.fi) f(trace[u][0][0].se.fi, u, 0, 0);
	}
	else {
		if (trace[u][1][0].fi == -1) {
			for (int v : edges[u]) {
				if (v == par) continue;
				if (v == trace[u][1][0].se.fi || v == trace[u][1][0].se.se) continue;
				res.push_back(v);
			}
			if (trace[u][1][0].se.fi) f(trace[u][1][0].se.fi, u, 0, 1);
			res.push_back(u);
			if (trace[u][1][0].se.se) f(trace[u][1][0].se.se, u, 1, 0);
			return;
		}
		if (trace[u][1][0].fi) f(trace[u][1][0].fi, u, 0, 1);
		res.push_back(u);
		if (trace[u][1][0].se.fi) f(trace[u][1][0].se.fi, u, 1, 1);
		for (int v : edges[u]) {
			if (v == par) continue;
			if (v == trace[u][1][0].fi || v == trace[u][1][0].se.fi || v == trace[u][1][0].se.se) continue;
			res.push_back(v);
		}
		if (trace[u][1][0].se.se) f(trace[u][1][0].se.se, u, 0, 0);
	}
}

void process() {
	dfs(1, 0);
	f(1, 0, 0, 0);
	cout << dp[1][0][0] + a[1] << '\n';
	cout << (int)res.size() << '\n';
	for (int v : res) cout << v << (v == res.back() ? '\n' : ' ');
}
}

namespace subtask3 {

vector<int> res;
void dfs(int u, int par) {
	res.push_back(u);
	for (int v : edges[u]) {
		if (v == par) continue;
		for (int w : edges[v]) {
			if (w == u) continue;
			dfs(w, v);
		}
		res.push_back(v);
	}
}

void process() {
	int total = 0;
	for (int i = 1; i <= n; i++) total += a[i];
	dfs(1, 0);
	cout << total << '\n';
	cout << n << '\n';
	for (int v : res) cout << v << (v == res.back() ? '\n' : ' ');
}

}

signed main() {
	cin.tie(0)->sync_with_stdio(false);
	cin >> n >> k;
	foru(i, 1, n - 1) {
		int u, v; cin >> u >> v;
		edges[u].pb(v);
		edges[v].pb(u);
	}
	foru(i, 1, n) cin >> a[i];
	if (k == 1) subtask1::process();
	if (k == 2) subtask2::process();
	if (k == 3) subtask3::process();
	cerr << "Time elapsed: " << __TIME << " s.\n";
	return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29020 KB Output is correct
2 Correct 7 ms 29016 KB Output is correct
3 Correct 87 ms 40664 KB Output is correct
4 Correct 104 ms 40756 KB Output is correct
5 Correct 93 ms 40528 KB Output is correct
6 Correct 85 ms 41300 KB Output is correct
7 Correct 64 ms 40896 KB Output is correct
8 Correct 79 ms 40136 KB Output is correct
9 Correct 146 ms 64216 KB Output is correct
10 Correct 124 ms 54176 KB Output is correct
11 Correct 61 ms 41096 KB Output is correct
12 Correct 7 ms 29016 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29020 KB Output is correct
2 Correct 7 ms 29016 KB Output is correct
3 Correct 6 ms 29020 KB Output is correct
4 Correct 6 ms 29200 KB Output is correct
5 Correct 6 ms 29228 KB Output is correct
6 Correct 6 ms 29020 KB Output is correct
7 Correct 6 ms 29148 KB Output is correct
8 Correct 6 ms 29020 KB Output is correct
9 Correct 6 ms 29016 KB Output is correct
10 Correct 6 ms 29016 KB Output is correct
11 Correct 6 ms 29140 KB Output is correct
12 Correct 6 ms 29020 KB Output is correct
13 Correct 6 ms 29020 KB Output is correct
14 Correct 6 ms 29020 KB Output is correct
15 Correct 6 ms 29020 KB Output is correct
16 Correct 6 ms 29124 KB Output is correct
17 Correct 6 ms 29020 KB Output is correct
18 Correct 6 ms 29016 KB Output is correct
19 Correct 6 ms 29020 KB Output is correct
20 Correct 6 ms 29276 KB Output is correct
21 Correct 6 ms 29020 KB Output is correct
22 Correct 6 ms 29020 KB Output is correct
23 Correct 6 ms 29020 KB Output is correct
24 Correct 6 ms 29020 KB Output is correct
25 Correct 6 ms 29020 KB Output is correct
26 Correct 6 ms 29020 KB Output is correct
27 Correct 6 ms 29020 KB Output is correct
28 Correct 6 ms 29020 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29020 KB Output is correct
2 Correct 7 ms 29016 KB Output is correct
3 Correct 6 ms 29020 KB Output is correct
4 Correct 6 ms 29200 KB Output is correct
5 Correct 6 ms 29228 KB Output is correct
6 Correct 6 ms 29020 KB Output is correct
7 Correct 6 ms 29148 KB Output is correct
8 Correct 6 ms 29020 KB Output is correct
9 Correct 6 ms 29016 KB Output is correct
10 Correct 6 ms 29016 KB Output is correct
11 Correct 6 ms 29140 KB Output is correct
12 Correct 6 ms 29020 KB Output is correct
13 Correct 6 ms 29020 KB Output is correct
14 Correct 6 ms 29020 KB Output is correct
15 Correct 6 ms 29020 KB Output is correct
16 Correct 6 ms 29124 KB Output is correct
17 Correct 6 ms 29020 KB Output is correct
18 Correct 6 ms 29016 KB Output is correct
19 Correct 6 ms 29020 KB Output is correct
20 Correct 6 ms 29276 KB Output is correct
21 Correct 6 ms 29020 KB Output is correct
22 Correct 6 ms 29020 KB Output is correct
23 Correct 6 ms 29020 KB Output is correct
24 Correct 6 ms 29020 KB Output is correct
25 Correct 6 ms 29020 KB Output is correct
26 Correct 6 ms 29020 KB Output is correct
27 Correct 6 ms 29020 KB Output is correct
28 Correct 6 ms 29020 KB Output is correct
29 Correct 7 ms 31324 KB Output is correct
30 Correct 8 ms 31324 KB Output is correct
31 Correct 8 ms 31324 KB Output is correct
32 Correct 8 ms 31324 KB Output is correct
33 Correct 8 ms 31324 KB Output is correct
34 Correct 10 ms 31580 KB Output is correct
35 Correct 8 ms 31324 KB Output is correct
36 Correct 8 ms 31576 KB Output is correct
37 Correct 8 ms 31324 KB Output is correct
38 Correct 8 ms 31580 KB Output is correct
39 Correct 8 ms 31324 KB Output is correct
40 Correct 8 ms 31324 KB Output is correct
41 Correct 8 ms 31324 KB Output is correct
42 Correct 8 ms 32092 KB Output is correct
43 Correct 8 ms 31836 KB Output is correct
44 Correct 8 ms 31560 KB Output is correct
45 Correct 8 ms 31580 KB Output is correct
46 Correct 8 ms 31580 KB Output is correct
47 Correct 7 ms 31828 KB Output is correct
48 Correct 7 ms 31324 KB Output is correct
49 Correct 7 ms 31424 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29020 KB Output is correct
2 Correct 7 ms 29016 KB Output is correct
3 Correct 6 ms 29020 KB Output is correct
4 Correct 6 ms 29200 KB Output is correct
5 Correct 6 ms 29228 KB Output is correct
6 Correct 6 ms 29020 KB Output is correct
7 Correct 6 ms 29148 KB Output is correct
8 Correct 6 ms 29020 KB Output is correct
9 Correct 6 ms 29016 KB Output is correct
10 Correct 6 ms 29016 KB Output is correct
11 Correct 6 ms 29140 KB Output is correct
12 Correct 6 ms 29020 KB Output is correct
13 Correct 6 ms 29020 KB Output is correct
14 Correct 6 ms 29020 KB Output is correct
15 Correct 6 ms 29020 KB Output is correct
16 Correct 6 ms 29124 KB Output is correct
17 Correct 6 ms 29020 KB Output is correct
18 Correct 6 ms 29016 KB Output is correct
19 Correct 6 ms 29020 KB Output is correct
20 Correct 6 ms 29276 KB Output is correct
21 Correct 6 ms 29020 KB Output is correct
22 Correct 6 ms 29020 KB Output is correct
23 Correct 6 ms 29020 KB Output is correct
24 Correct 6 ms 29020 KB Output is correct
25 Correct 6 ms 29020 KB Output is correct
26 Correct 6 ms 29020 KB Output is correct
27 Correct 6 ms 29020 KB Output is correct
28 Correct 6 ms 29020 KB Output is correct
29 Correct 7 ms 31324 KB Output is correct
30 Correct 8 ms 31324 KB Output is correct
31 Correct 8 ms 31324 KB Output is correct
32 Correct 8 ms 31324 KB Output is correct
33 Correct 8 ms 31324 KB Output is correct
34 Correct 10 ms 31580 KB Output is correct
35 Correct 8 ms 31324 KB Output is correct
36 Correct 8 ms 31576 KB Output is correct
37 Correct 8 ms 31324 KB Output is correct
38 Correct 8 ms 31580 KB Output is correct
39 Correct 8 ms 31324 KB Output is correct
40 Correct 8 ms 31324 KB Output is correct
41 Correct 8 ms 31324 KB Output is correct
42 Correct 8 ms 32092 KB Output is correct
43 Correct 8 ms 31836 KB Output is correct
44 Correct 8 ms 31560 KB Output is correct
45 Correct 8 ms 31580 KB Output is correct
46 Correct 8 ms 31580 KB Output is correct
47 Correct 7 ms 31828 KB Output is correct
48 Correct 7 ms 31324 KB Output is correct
49 Correct 7 ms 31424 KB Output is correct
50 Correct 221 ms 63476 KB Output is correct
51 Correct 254 ms 63508 KB Output is correct
52 Correct 225 ms 63504 KB Output is correct
53 Correct 225 ms 63576 KB Output is correct
54 Correct 212 ms 63516 KB Output is correct
55 Correct 234 ms 63372 KB Output is correct
56 Correct 199 ms 64080 KB Output is correct
57 Correct 221 ms 63408 KB Output is correct
58 Correct 204 ms 64316 KB Output is correct
59 Correct 236 ms 63668 KB Output is correct
60 Correct 193 ms 64428 KB Output is correct
61 Correct 272 ms 78164 KB Output is correct
62 Correct 243 ms 70180 KB Output is correct
63 Correct 227 ms 67156 KB Output is correct
64 Correct 201 ms 64144 KB Output is correct
65 Correct 333 ms 127692 KB Output is correct
66 Correct 310 ms 99116 KB Output is correct
67 Correct 257 ms 83912 KB Output is correct
68 Correct 277 ms 83140 KB Output is correct
69 Correct 257 ms 74684 KB Output is correct
70 Correct 231 ms 71880 KB Output is correct
71 Correct 151 ms 63712 KB Output is correct
72 Correct 128 ms 63268 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 27088 KB Output is correct
2 Correct 7 ms 27228 KB Output is correct
3 Correct 6 ms 27228 KB Output is correct
4 Correct 6 ms 27236 KB Output is correct
5 Correct 6 ms 27228 KB Output is correct
6 Correct 6 ms 27228 KB Output is correct
7 Correct 6 ms 27076 KB Output is correct
8 Correct 5 ms 26972 KB Output is correct
9 Correct 6 ms 27080 KB Output is correct
10 Correct 8 ms 27228 KB Output is correct
11 Correct 6 ms 27228 KB Output is correct
12 Correct 7 ms 27144 KB Output is correct
13 Correct 7 ms 27228 KB Output is correct
14 Correct 6 ms 27228 KB Output is correct
15 Correct 6 ms 27072 KB Output is correct
16 Correct 6 ms 27228 KB Output is correct
17 Correct 6 ms 27228 KB Output is correct
18 Correct 7 ms 27228 KB Output is correct
19 Correct 6 ms 27228 KB Output is correct
20 Correct 6 ms 27228 KB Output is correct
21 Correct 6 ms 27232 KB Output is correct
22 Correct 7 ms 27480 KB Output is correct
23 Correct 6 ms 27228 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 27088 KB Output is correct
2 Correct 7 ms 27228 KB Output is correct
3 Correct 6 ms 27228 KB Output is correct
4 Correct 6 ms 27236 KB Output is correct
5 Correct 6 ms 27228 KB Output is correct
6 Correct 6 ms 27228 KB Output is correct
7 Correct 6 ms 27076 KB Output is correct
8 Correct 5 ms 26972 KB Output is correct
9 Correct 6 ms 27080 KB Output is correct
10 Correct 8 ms 27228 KB Output is correct
11 Correct 6 ms 27228 KB Output is correct
12 Correct 7 ms 27144 KB Output is correct
13 Correct 7 ms 27228 KB Output is correct
14 Correct 6 ms 27228 KB Output is correct
15 Correct 6 ms 27072 KB Output is correct
16 Correct 6 ms 27228 KB Output is correct
17 Correct 6 ms 27228 KB Output is correct
18 Correct 7 ms 27228 KB Output is correct
19 Correct 6 ms 27228 KB Output is correct
20 Correct 6 ms 27228 KB Output is correct
21 Correct 6 ms 27232 KB Output is correct
22 Correct 7 ms 27480 KB Output is correct
23 Correct 6 ms 27228 KB Output is correct
24 Correct 98 ms 37596 KB Output is correct
25 Correct 112 ms 37596 KB Output is correct
26 Correct 102 ms 37608 KB Output is correct
27 Correct 100 ms 37572 KB Output is correct
28 Correct 100 ms 37464 KB Output is correct
29 Correct 97 ms 37316 KB Output is correct
30 Correct 91 ms 38212 KB Output is correct
31 Correct 101 ms 37236 KB Output is correct
32 Correct 90 ms 38340 KB Output is correct
33 Correct 113 ms 37340 KB Output is correct
34 Correct 105 ms 38344 KB Output is correct
35 Correct 84 ms 37828 KB Output is correct
36 Correct 92 ms 37124 KB Output is correct
37 Correct 120 ms 37608 KB Output is correct
38 Correct 88 ms 38088 KB Output is correct
39 Correct 139 ms 45764 KB Output is correct
40 Correct 122 ms 43308 KB Output is correct
41 Correct 124 ms 41556 KB Output is correct
42 Correct 114 ms 40944 KB Output is correct
43 Correct 157 ms 39820 KB Output is correct
44 Correct 137 ms 38468 KB Output is correct
45 Correct 73 ms 37832 KB Output is correct
46 Correct 71 ms 37356 KB Output is correct