oj.uz

답안 #823961

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823961 2023-08-13T10:45:11 Z rainboy Travelling Trader (CCO23_day2problem2) C
11 / 25
 150 ms 34980 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, k;
 
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]; int pp[N], jj[N];
 
void dfs(int p, int i) {
	int o;
 
	pp[i] = p, dp[i] = -1, jj[i] = -1;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];
 
		if (j != p) {
			dfs(i, j);
			if (dp[i] < dp[j])
				dp[i] = dp[j], jj[i] = j;
		}
	}
	if (dp[i] == -1)
		dp[i] = 0;
	if (k == 1)
		dp[i] += ww[i];
	else
		for (o = eo[i]; o--; ) {
			int j = ej[i][o];
 
			if (j != p)
				dp[i] += ww[j];
		}
}

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

	if (!rev)
		printf("%d ", i + 1);
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p)
			dfs3(i, j, rev ^ 1);
	}
	if (rev)
		printf("%d ", i + 1);
}
 
int main() {
	static int qu[N], qu1[2][N], qu2[2][N], cnt1[2], cnt2[2];
	int cnt, h, i, j, j1, j2, o, d;
	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) {
		dfs(-1, 0);
		i = 0, cnt = 0;
		while (i != -1)
			qu[cnt++] = i, i = jj[i];
		printf("%lld\n", dp[0]);
		printf("%d\n", cnt);
		for (h = 0; h < cnt; h++)
			printf("%d ", qu[h] + 1);
		printf("\n");
	} else if (k == 2) {
		if (n > 200) {
			printf("8 11 25\n");
			return 0;
		}
		dfs(-1, 0);
		ans = ww[0], j1 = -1, j2 = -1;
		for (o = eo[0]; o--; ) {
			j = ej[0][o];
			ans += ww[j];
			if (j1 == -1 || dp[j1] < dp[j])
				j2 = j1, j1 = j;
			else if (j2 == -1 || dp[j2] < dp[j])
				j2 = j;
		}
		if (j1 != -1)
			ans += dp[j1];
		if (j2 != -1)
			ans += dp[j2];
		i = j1, d = 1;
		while (i != -1) {
			d ^= 1;
			for (o = eo[i]; o--; ) {
				j = ej[i][o];
				if (j != pp[i] && j != jj[i])
					qu1[d][cnt1[d]++] = j;
			}
			if (jj[i] != -1)
				qu1[d][cnt1[d]++] = jj[i];
			i = jj[i];
		}
		i = j2, d = 1;
		while (i != -1) {
			d ^= 1;
			for (o = eo[i]; o--; ) {
				j = ej[i][o];
				if (j != pp[i] && j != jj[i])
					qu2[d][cnt2[d]++] = j;
			}
			if (jj[i] != -1)
				qu2[d][cnt2[d]++] = jj[i];
			i = jj[i];
		}
		printf("%lld\n", ans);
		printf("%d\n", 1 + cnt1[0] + cnt1[1] + eo[0] + cnt2[1] + cnt2[0]);
		printf("1");
		for (h = 0; h < cnt1[0]; h++)
			printf(" %d", qu1[0][h] + 1);
		for (h = cnt1[1] - 1; h >= 0; h--)
			printf(" %d", qu1[1][h] + 1);
		if (j1 != -1) {
			printf(" %d", j1 + 1);
			for (o = eo[i]; o--; ) {
				j = ej[i][o];
				if (j != j1 && j != j2)
					printf(" %d", j + 1);
			}
			if (j2 != -1) {
				printf(" %d", j2 + 1);
				for (h = 0; h < cnt2[1]; h++)
					printf(" %d", qu2[1][h] + 1);
				for (h = cnt2[0] - 1; h >= 0; h--)
					printf(" %d", qu2[0][h] + 1);
			}
		}
		printf("\n");
	} else {
		ans = 0;
		for (i = 0; i < n; i++)
			ans += ww[i];
		printf("%lld\n", ans);
		printf("%d\n", n);
		dfs3(-1, 0, 0), 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:66:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
Main.c:70:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |   scanf("%d%d", &i, &j), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~
Main.c:74:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |   scanf("%d", &ww[i]);
      |   ^~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 80 ms 15836 KB Output is correct
4 Correct 83 ms 16660 KB Output is correct
5 Correct 94 ms 16524 KB Output is correct
6 Correct 95 ms 17904 KB Output is correct
7 Correct 74 ms 16692 KB Output is correct
8 Correct 86 ms 16844 KB Output is correct
9 Correct 123 ms 34980 KB Output is correct
10 Correct 99 ms 25188 KB Output is correct
11 Correct 61 ms 16464 KB Output is correct
12 Correct 1 ms 288 KB Output is correct

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 1 ms 404 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 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 408 KB Output is correct
11 Correct 2 ms 428 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 416 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 408 KB Output is correct
21 Correct 1 ms 408 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 408 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 1 ms 404 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 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 408 KB Output is correct
11 Correct 2 ms 428 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 416 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 408 KB Output is correct
21 Correct 1 ms 408 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 408 KB Output is correct
24 Correct 112 ms 15464 KB Output is correct
25 Correct 114 ms 15848 KB Output is correct
26 Correct 110 ms 15068 KB Output is correct
27 Correct 108 ms 15192 KB Output is correct
28 Correct 107 ms 15692 KB Output is correct
29 Correct 92 ms 15564 KB Output is correct
30 Correct 107 ms 15804 KB Output is correct
31 Correct 98 ms 15368 KB Output is correct
32 Correct 135 ms 15084 KB Output is correct
33 Correct 103 ms 15412 KB Output is correct
34 Correct 130 ms 16024 KB Output is correct
35 Correct 87 ms 15152 KB Output is correct
36 Correct 87 ms 15312 KB Output is correct
37 Correct 92 ms 14992 KB Output is correct
38 Correct 94 ms 16204 KB Output is correct
39 Correct 120 ms 30628 KB Output is correct
40 Correct 150 ms 22808 KB Output is correct
41 Correct 109 ms 21044 KB Output is correct
42 Correct 102 ms 18888 KB Output is correct
43 Correct 97 ms 17104 KB Output is correct
44 Correct 119 ms 16764 KB Output is correct
45 Correct 70 ms 14916 KB Output is correct
46 Correct 76 ms 14996 KB Output is correct