oj.uz

Submission #824211

# Submission time Handle Problem Language Result Execution time Memory
824211 2023-08-13T18:25:18 Z rainboy Travelling Trader (CCO23_day2problem2) C
25 / 25
 161 ms 43472 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	200000

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], dr[N]; int jjp1[N], jjp2[N], jjp3[N], jjq[N], jjr[N]; char ttq[N], ttr[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;
		}
	}
	dp[i] = (j_ == -1 ? 0 : dp[j_]) + ww[i], jjp1[i] = j_;
}

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

void dfs2(int p, int i) {
	int o, jp1, jp2, jp3, jp1_, jp2_, jq, jr, t;
	long long w, x, x_;

	w = 0, jp1 = jp2 = jp3 = -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])
				jp3 = jp2, jp2 = jp1, jp1 = j;
			else if (jp2 == -1 || dp[jp2] < dp[j])
				jp3 = jp2, jp2 = j;
			else if (jp3 == -1 || dp[jp3] < dp[j])
				jp3 = j;
		}
	}
	dp[i] = (jp1 == -1 ? 0 : dp[jp1]) + w, jjp1[i] = jp1, jjp2[i] = jp2, jjp3[i] = jp3;
	x_ = -1, jq = -1, t = 2;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p) {
			jp1_ = j != jp1 ? jp1 : jp2;
			x = (jp1_ == -1 ? 0 : dp[jp1_]) + dq[j] + w;
			if (x_ < x)
				x_ = x, jq = j, t = 2;
			x = dr[j] + ww[j];
			if (x_ < x)
				x_ = x, jq = j, t = 3;
		}
	}
	dq[i] = x_ == -1 ? 0 : x_, jjq[i] = jq, ttq[i] = t;
	x_ = -1, jr = -1, t = 2;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p) {
			if (j == jp1)
				jp1_ = jp2, jp2_ = jp3;
			else if (j == jp2)
				jp1_ = jp1, jp2_ = jp3;
			else
				jp1_ = jp1, jp2_ = jp2;
			x = (jp1_ == -1 ? 0 : dp[jp1_]) + (jp2_ == -1 ? 0 : dp[jp2_]) + dq[j] + w;
			if (x_ < x)
				x_ = x, jr = j, t = 2;
			x = (jp1_ == -1 ? 0 : dp[jp1_]) + dr[j] + w;
			if (x_ < x)
				x_ = x, jr = j, t = 3;
		}
	}
	dr[i] = x_ == -1 ? 0 : x_, jjr[i] = jr, ttr[i] = t;
}

void dfs2_(int p, int i, int mode) {
	int o, jp1, jp2, jq, jr;

	if (mode == -1) {
		jp1 = jjp1[i];
		for (o = eo[i]; o--; ) {
			int j = ej[i][o];

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

			if (j != p && j != jp1)
				qu[cnt++] = j;
		}
	} else if (mode == 2) {
		jq = jjq[i], jp1 = jq != jjp1[i] ? jjp1[i] : jjp2[i];
		if (ttq[i] == 2) {
			qu[cnt++] = i;
			if (jp1 != -1)
				dfs2_(i, jp1, -1);
			for (o = eo[i]; o--; ) {
				int j = ej[i][o];

				if (j != p && j != jp1 && j != jq)
					qu[cnt++] = j;
			}
			if (jq != -1)
				dfs2_(i, jq, 2);
		} else {
			qu[cnt++] = i;
			dfs2_(i, jq, 3);
		}
	} else {
		jr = jjr[i];
		if (jr == jjp1[i])
			jp1 = jjp2[i], jp2 = jjp3[i];
		else if (jr == jjp2[i])
			jp1 = jjp1[i], jp2 = jjp3[i];
		else
			jp1 = jjp1[i], jp2 = jjp2[i];
		if (ttr[i] == 2) {
			if (jp1 != -1)
				dfs2_(i, jp1, 1);
			qu[cnt++] = i;
			if (jp2 != -1)
				dfs2_(i, jp2, -1);
			for (o = eo[i]; o--; ) {
				int j = ej[i][o];

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

				if (j != p && j != jp1 && j != jr)
					qu[cnt++] = j;
			}
			if (jp1 != -1)
				dfs2_(i, jp1, 1);
			qu[cnt++] = i;
			dfs2_(i, jr, 3);
		}
	}
}

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, 2);
	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:11:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   11 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
Main.c: In function 'main':
Main.c:197:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  197 |  scanf("%d%d", &n, &k);
      |  ^~~~~~~~~~~~~~~~~~~~~
Main.c:201:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  201 |   scanf("%d%d", &i, &j), i--, j--;
      |   ^~~~~~~~~~~~~~~~~~~~~
Main.c:205:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
  205 |   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 340 KB Output is correct
3 Correct 67 ms 12616 KB Output is correct
4 Correct 75 ms 12540 KB Output is correct
5 Correct 81 ms 12112 KB Output is correct
6 Correct 86 ms 13232 KB Output is correct
7 Correct 62 ms 12880 KB Output is correct
8 Correct 65 ms 12464 KB Output is correct
9 Correct 103 ms 29632 KB Output is correct
10 Correct 91 ms 20804 KB Output is correct
11 Correct 54 ms 12016 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #2
7.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 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 0 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 0 ms 340 KB Output is correct
14 Correct 0 ms 292 KB Output is correct
15 Correct 0 ms 292 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 300 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 296 KB Output is correct

Subtask #3
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 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 0 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 0 ms 340 KB Output is correct
14 Correct 0 ms 292 KB Output is correct
15 Correct 0 ms 292 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 300 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 296 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 564 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 564 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 480 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 1 ms 556 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 552 KB Output is correct
41 Correct 1 ms 564 KB Output is correct
42 Correct 2 ms 724 KB Output is correct
43 Correct 1 ms 596 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 1 ms 564 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 1 ms 596 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 540 KB Output is correct

Subtask #4
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 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 0 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 0 ms 340 KB Output is correct
14 Correct 0 ms 292 KB Output is correct
15 Correct 0 ms 292 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 300 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 296 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 564 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 564 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 480 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 1 ms 556 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 552 KB Output is correct
41 Correct 1 ms 564 KB Output is correct
42 Correct 2 ms 724 KB Output is correct
43 Correct 1 ms 596 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 1 ms 564 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 1 ms 596 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 540 KB Output is correct
50 Correct 117 ms 23364 KB Output is correct
51 Correct 108 ms 23136 KB Output is correct
52 Correct 108 ms 23088 KB Output is correct
53 Correct 110 ms 22324 KB Output is correct
54 Correct 118 ms 22736 KB Output is correct
55 Correct 128 ms 22416 KB Output is correct
56 Correct 103 ms 23604 KB Output is correct
57 Correct 110 ms 22700 KB Output is correct
58 Correct 100 ms 23924 KB Output is correct
59 Correct 118 ms 22464 KB Output is correct
60 Correct 96 ms 24116 KB Output is correct
61 Correct 114 ms 24268 KB Output is correct
62 Correct 112 ms 23636 KB Output is correct
63 Correct 108 ms 23100 KB Output is correct
64 Correct 128 ms 23176 KB Output is correct
65 Correct 159 ms 43472 KB Output is correct
66 Correct 146 ms 34312 KB Output is correct
67 Correct 161 ms 29628 KB Output is correct
68 Correct 149 ms 28364 KB Output is correct
69 Correct 122 ms 26364 KB Output is correct
70 Correct 132 ms 25036 KB Output is correct
71 Correct 65 ms 22628 KB Output is correct
72 Correct 86 ms 21164 KB Output is correct

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 340 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 2 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 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 340 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 2 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 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 85 ms 12244 KB Output is correct
25 Correct 103 ms 12304 KB Output is correct
26 Correct 86 ms 12272 KB Output is correct
27 Correct 88 ms 12200 KB Output is correct
28 Correct 83 ms 12236 KB Output is correct
29 Correct 98 ms 11852 KB Output is correct
30 Correct 90 ms 12888 KB Output is correct
31 Correct 86 ms 11864 KB Output is correct
32 Correct 86 ms 12876 KB Output is correct
33 Correct 89 ms 11904 KB Output is correct
34 Correct 86 ms 12908 KB Output is correct
35 Correct 77 ms 12560 KB Output is correct
36 Correct 76 ms 12112 KB Output is correct
37 Correct 77 ms 11980 KB Output is correct
38 Correct 75 ms 12776 KB Output is correct
39 Correct 97 ms 27384 KB Output is correct
40 Correct 116 ms 19512 KB Output is correct
41 Correct 89 ms 17484 KB Output is correct
42 Correct 89 ms 15564 KB Output is correct
43 Correct 87 ms 13644 KB Output is correct
44 Correct 81 ms 13256 KB Output is correct
45 Correct 67 ms 11716 KB Output is correct
46 Correct 67 ms 11696 KB Output is correct