oj.uz

Submission #823991

# Submission time Handle Problem Language Result Execution time Memory
823991 2023-08-13T11:12:04 Z rainboy Travelling Trader (CCO23_day2problem2) C
11 / 25
 129 ms 29732 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	200000

long long max(long long a, long long b) { return a > b ? a : b; }

int *ej[N], eo[N], ww[N], n;

void append(int i, int j) {
	int o = eo[i]++;

	if (o >= 2 && (o & o - 1) == 0)
		ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
	ej[i][o] = j;
}

long long dp[N], dq[N]; int jj[N], jjp1[N], jjp2[N], jjq[N];
int qu[N], cnt;

void dfs1(int p, int i) {
	int o, j_;

	j_ = -1;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p) {
			dfs1(i, j);
			if (j_ == -1 || dp[j_] < dp[j])
				j_ = j;
		}
	}
	jj[i] = j_, dp[i] = (j_ == -1 ? 0 : dp[j_]) + ww[i];
}

void dfs1_(int i) {
	qu[cnt++] = i;
	if (jj[i] != -1)
		dfs1_(jj[i]);
}

void dfs2(int p, int i) {
	int o, jp1, jp2, jp, jq;
	long long w, x, x_;

	w = 0, jp1 = jp2 = -1;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p) {
			dfs2(i, j);
			w += ww[j];
			if (jp1 == -1 || dp[jp1] < dp[j])
				jp2 = jp1, jp1 = j;
			else if (jp2 == -1 || dp[jp2] < dp[j])
				jp2 = j;
		}
	}
	jjp1[i] = jp1, jjp2[i] = jp2, dp[i] = (jp1 == -1 ? 0 : dp[jp1]) + w;
	x_ = -1, jq = -1;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p) {
			jp = j != jp1 ? jp1 : jp2;
			x = (jp == -1 ? 0 : dp[jp]) + dq[j];
			if (x_ < x)
				x_ = x, jq = j;
		}
	}
	jjq[i] = jq, dq[i] = (x_ == -1 ? 0 : x_) + w;
}

void dfs2_(int p, int i, int mode) {
	int o, jp, jq;

	if (mode == 0) {
		jq = jjq[i], jp = jq != jjp1[i] ? jjp1[i] : jjp2[i];
		qu[cnt++] = i;
		if (jp != -1)
			dfs2_(i, jp, -1);
		for (o = eo[i]; o--; ) {
			int j = ej[i][o];

			if (j != p && j != jp && j != jq)
				qu[cnt++] = j;
		}
		if (jq != -1)
			dfs2_(i, jq, 0);
	} else if (mode == -1) {
		jp = jjp1[i];
		for (o = eo[i]; o--; ) {
			int j = ej[i][o];

			if (j != p && j != jp)
				qu[cnt++] = j;
		}
		if (jp != -1)
			dfs2_(i, jp, 1);
		qu[cnt++] = i;
	} else {
		jp = jjp1[i];
		qu[cnt++] = i;
		if (jp != -1)
			dfs2_(i, jp, -1);
		for (o = eo[i]; o--; ) {
			int j = ej[i][o];

			if (j != p && j != jp)
				qu[cnt++] = j;
		}
	}
}

void dfs3_(int p, int i, int rev) {
	int o;

	if (!rev)
		qu[cnt++] = i;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p)
			dfs3_(i, j, rev ^ 1);
	}
	if (rev)
		qu[cnt++] = i;
}

int main() {
	int k, h, i, j;
	long long ans;

	scanf("%d%d", &n, &k);
	for (i = 0; i < n; i++)
		ej[i] = (int *) malloc(2 * sizeof *ej[i]);
	for (h = 0; h < n - 1; h++) {
		scanf("%d%d", &i, &j), i--, j--;
		append(i, j), append(j, i);
	}
	for (i = 0; i < n; i++)
		scanf("%d", &ww[i]);
	if (k == 1)
		dfs1(-1, 0), ans = dp[0], dfs1_(0);
	else if (k == 2) {
		if (n > 200) {
			printf("8 18 25\n");
			return 0;
		}
		dfs2(-1, 0), ans = dq[0] + ww[0], dfs2_(-1, 0, 0);
	} else {
		ans = 0;
		for (i = 0; i < n; i++)
			ans += ww[i];
		dfs3_(-1, 0, 0);
	}
	printf("%lld\n", ans);
	printf("%d\n", cnt);
	for (h = 0; h < cnt; h++)
		printf("%d ", qu[h] + 1);
	printf("\n");
	return 0;
}

Compilation message

Main.c: In function 'append':
Main.c:13:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   13 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
Main.c: In function 'main':
Main.c:135:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  135 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
Main.c:139:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  139 |   scanf("%d%d", &i, &j), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~
Main.c:143:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  143 |   scanf("%d", &ww[i]);
      |   ^~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 78 ms 12684 KB Output is correct
4 Correct 85 ms 12556 KB Output is correct
5 Correct 80 ms 12116 KB Output is correct
6 Correct 79 ms 13104 KB Output is correct
7 Correct 83 ms 12816 KB Output is correct
8 Correct 71 ms 12420 KB Output is correct
9 Correct 126 ms 29732 KB Output is correct
10 Correct 102 ms 20824 KB Output is correct
11 Correct 53 ms 12008 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 396 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 129 ms 12364 KB Output is correct
25 Correct 94 ms 12304 KB Output is correct
26 Correct 102 ms 12236 KB Output is correct
27 Correct 89 ms 12248 KB Output is correct
28 Correct 102 ms 12268 KB Output is correct
29 Correct 87 ms 11892 KB Output is correct
30 Correct 90 ms 12844 KB Output is correct
31 Correct 85 ms 11868 KB Output is correct
32 Correct 94 ms 12928 KB Output is correct
33 Correct 86 ms 11852 KB Output is correct
34 Correct 102 ms 12936 KB Output is correct
35 Correct 74 ms 12492 KB Output is correct
36 Correct 79 ms 12212 KB Output is correct
37 Correct 84 ms 11928 KB Output is correct
38 Correct 99 ms 12816 KB Output is correct
39 Correct 111 ms 27336 KB Output is correct
40 Correct 92 ms 19508 KB Output is correct
41 Correct 97 ms 17484 KB Output is correct
42 Correct 88 ms 15548 KB Output is correct
43 Correct 85 ms 13600 KB Output is correct
44 Correct 88 ms 13260 KB Output is correct
45 Correct 66 ms 11712 KB Output is correct
46 Correct 68 ms 11740 KB Output is correct