oj.uz

Submission #793655

# Submission time Handle Problem Language Result Execution time Memory
793655 2023-07-26T05:09:09 Z GEN 이지후(#10094) Travelling Trader (CCO23_day2problem2) C++17
9 / 25
 150 ms 26744 KB 
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = array<lint, 2>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
const int MAXN = 200005;

vector<int> gph[MAXN];
int par[MAXN], a[MAXN];

pi dfsFar(int x, int p) {
	pi ret{0, x};
	for (auto &y : gph[x]) {
		if (y == p)
			continue;
		auto z = dfsFar(y, x);
		ret = max(ret, z);
	}
	ret[0] += a[x];
	return ret;
}

vector<int> ans;

void dfs2(int x, int p, int d) {
	if (!d)
		ans.push_back(x);
	for (auto &i : gph[x]) {
		if (i != p) {
			dfs2(i, x, 1 - d);
		}
	}
	if (d)
		ans.push_back(x);
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, k;
	cin >> n >> k;
	for (int i = 0; i < n - 1; i++) {
		int u, v;
		cin >> u >> v;
		u--;
		v--;
		gph[u].push_back(v);
		gph[v].push_back(u);
	}
	for (int i = 0; i < n; i++)
		cin >> a[i];
	if (k == 1) {
		auto [p, l] = dfsFar(0, -1);
		cout << p << "\n";
		vector<int> v;
		for (int j = l;; j = par[j]) {
			v.push_back(j + 1);
			if (j == 0)
				break;
		}
		reverse(all(v));
		cout << sz(v) << "\n";
		for (auto &pth : v) {
			cout << pth << " ";
		}
		return 0;
	}
	if (k == 3) {
		cout << accumulate(a, a + n, 0ll) << "\n" << n << "\n";
		dfs2(0, -1, 0);
		for (auto &pth : ans) {
			cout << pth + 1 << " ";
		}
	}
}

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Incorrect 3 ms 5060 KB total profit is not correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4948 KB Unexpected end of file - int64 expected
2 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 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 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5104 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 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 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 5076 KB Output is correct
22 Correct 3 ms 5204 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 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 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 3 ms 5104 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 5076 KB Output is correct
16 Correct 3 ms 5076 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 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 5076 KB Output is correct
22 Correct 3 ms 5204 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 94 ms 14452 KB Output is correct
25 Correct 97 ms 14404 KB Output is correct
26 Correct 98 ms 14464 KB Output is correct
27 Correct 89 ms 14488 KB Output is correct
28 Correct 90 ms 14440 KB Output is correct
29 Correct 96 ms 14284 KB Output is correct
30 Correct 115 ms 14988 KB Output is correct
31 Correct 95 ms 14248 KB Output is correct
32 Correct 84 ms 15064 KB Output is correct
33 Correct 92 ms 14264 KB Output is correct
34 Correct 95 ms 15108 KB Output is correct
35 Correct 67 ms 14956 KB Output is correct
36 Correct 77 ms 14620 KB Output is correct
37 Correct 87 ms 14356 KB Output is correct
38 Correct 84 ms 15164 KB Output is correct
39 Correct 150 ms 26744 KB Output is correct
40 Correct 125 ms 20532 KB Output is correct
41 Correct 105 ms 18364 KB Output is correct
42 Correct 92 ms 17344 KB Output is correct
43 Correct 105 ms 15740 KB Output is correct
44 Correct 91 ms 15432 KB Output is correct
45 Correct 72 ms 14208 KB Output is correct
46 Correct 66 ms 14208 KB Output is correct