oj.uz

답안 #824108

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824108 2023-08-13T14:17:35 Z rainboy Travelling Trader (CCO23_day2problem2) C
11 / 25
 143 ms 34204 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)
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 85 ms 15076 KB Output is correct
4 Correct 116 ms 15892 KB Output is correct
5 Correct 84 ms 15760 KB Output is correct
6 Correct 82 ms 16972 KB Output is correct
7 Correct 88 ms 15976 KB Output is correct
8 Correct 95 ms 16072 KB Output is correct
9 Correct 106 ms 34204 KB Output is correct
10 Correct 120 ms 24400 KB Output is correct
11 Correct 71 ms 15768 KB Output is correct
12 Correct 1 ms 292 KB Output is correct

Subtask #2
0 / 7.0

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

Subtask #3
0 / 3.0

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

Subtask #4
0 / 4.0

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

Subtask #5
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 428 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 364 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 300 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 396 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 392 KB Output is correct
13 Correct 2 ms 464 KB Output is correct
14 Correct 1 ms 428 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 416 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 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 540 KB Output is correct
23 Correct 1 ms 424 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 428 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 364 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 300 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 396 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 392 KB Output is correct
13 Correct 2 ms 464 KB Output is correct
14 Correct 1 ms 428 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 416 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 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 540 KB Output is correct
23 Correct 1 ms 424 KB Output is correct
24 Correct 108 ms 16212 KB Output is correct
25 Correct 103 ms 16504 KB Output is correct
26 Correct 104 ms 15784 KB Output is correct
27 Correct 115 ms 15944 KB Output is correct
28 Correct 92 ms 16404 KB Output is correct
29 Correct 99 ms 16292 KB Output is correct
30 Correct 105 ms 16604 KB Output is correct
31 Correct 103 ms 16152 KB Output is correct
32 Correct 127 ms 15844 KB Output is correct
33 Correct 89 ms 16292 KB Output is correct
34 Correct 89 ms 16716 KB Output is correct
35 Correct 83 ms 15948 KB Output is correct
36 Correct 91 ms 15996 KB Output is correct
37 Correct 85 ms 15820 KB Output is correct
38 Correct 84 ms 16976 KB Output is correct
39 Correct 143 ms 31384 KB Output is correct
40 Correct 141 ms 23580 KB Output is correct
41 Correct 124 ms 21812 KB Output is correct
42 Correct 89 ms 19728 KB Output is correct
43 Correct 101 ms 17960 KB Output is correct
44 Correct 98 ms 17516 KB Output is correct
45 Correct 71 ms 15768 KB Output is correct
46 Correct 71 ms 15840 KB Output is correct