oj.uz

Submission #544762

# Submission time Handle Problem Language Result Execution time Memory
544762 2022-04-02T16:31:20 Z rainboy The Xana coup (BOI21_xanadu) C
100 / 100
 130 ms 15700 KB 
#include <stdio.h>
#include <stdlib.h>

#define N	100000
#define INF	0x3f3f3f3f

int min(int a, int b) { return a < b ? a : b; }

int *ej[N], eo[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;
}

int aa[N], dp[N][2][2];

void dfs(int p, int i) {
	static int xx[2][2], yy[2][2];
	int o, a, b;

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

		if (j != p)
			dfs(i, j);
	}
	for (a = 0; a < 2; a++)
		xx[a][0] = 0, xx[a][1] = INF;
	for (o = eo[i]; o--; ) {
		int j = ej[i][o];

		if (j != p) {
			for (a = 0; a < 2; a++)
				for (b = 0; b < 2; b++)
					yy[a][b] = min(xx[a][b] + dp[j][a][0], xx[a][b ^ 1] + dp[j][a][1]);
			for (a = 0; a < 2; a++)
				for (b = 0; b < 2; b++)
					xx[a][b] = min(yy[a][b], INF);
		}
	}
	for (a = 0; a < 2; a++)
		for (b = 0; b < 2; b++)
			dp[i][aa[i] ^ a ^ b][a] = xx[a][b] + a;
}

int main() {
	int n, h, i, j, x;

	scanf("%d", &n);
	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", &aa[i]);
	dfs(-1, 0);
	x = min(dp[0][0][0], dp[0][0][1]);
	if (x == INF)
		printf("impossible\n");
	else
		printf("%d\n", x);
	return 0;
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 260 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 288 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 15556 KB Output is correct
2 Correct 66 ms 15376 KB Output is correct
3 Correct 63 ms 15580 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 15612 KB Output is correct
2 Correct 52 ms 15344 KB Output is correct
3 Correct 59 ms 15700 KB Output is correct
4 Correct 84 ms 6996 KB Output is correct
5 Correct 71 ms 7728 KB Output is correct
6 Correct 68 ms 7836 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 16 ms 2828 KB Output is correct
9 Correct 69 ms 7820 KB Output is correct
10 Correct 85 ms 7876 KB Output is correct
11 Correct 81 ms 8268 KB Output is correct
12 Correct 92 ms 8524 KB Output is correct
13 Correct 70 ms 7412 KB Output is correct
14 Correct 74 ms 7864 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 260 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 288 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 70 ms 15556 KB Output is correct
18 Correct 66 ms 15376 KB Output is correct
19 Correct 63 ms 15580 KB Output is correct
20 Correct 54 ms 15612 KB Output is correct
21 Correct 52 ms 15344 KB Output is correct
22 Correct 59 ms 15700 KB Output is correct
23 Correct 84 ms 6996 KB Output is correct
24 Correct 71 ms 7728 KB Output is correct
25 Correct 68 ms 7836 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 16 ms 2828 KB Output is correct
28 Correct 69 ms 7820 KB Output is correct
29 Correct 85 ms 7876 KB Output is correct
30 Correct 81 ms 8268 KB Output is correct
31 Correct 92 ms 8524 KB Output is correct
32 Correct 70 ms 7412 KB Output is correct
33 Correct 74 ms 7864 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 232 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 288 KB Output is correct
39 Correct 1 ms 292 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 296 KB Output is correct
45 Correct 62 ms 15516 KB Output is correct
46 Correct 64 ms 15372 KB Output is correct
47 Correct 71 ms 15696 KB Output is correct
48 Correct 74 ms 7076 KB Output is correct
49 Correct 67 ms 7720 KB Output is correct
50 Correct 98 ms 7760 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 21 ms 2840 KB Output is correct
53 Correct 70 ms 7716 KB Output is correct
54 Correct 94 ms 7964 KB Output is correct
55 Correct 86 ms 8300 KB Output is correct
56 Correct 85 ms 8520 KB Output is correct
57 Correct 63 ms 7384 KB Output is correct
58 Correct 64 ms 7772 KB Output is correct
59 Correct 16 ms 2776 KB Output is correct
60 Correct 68 ms 7096 KB Output is correct
61 Correct 65 ms 7832 KB Output is correct
62 Correct 72 ms 8024 KB Output is correct
63 Correct 130 ms 7996 KB Output is correct
64 Correct 96 ms 8012 KB Output is correct
65 Correct 66 ms 8448 KB Output is correct
66 Correct 67 ms 8396 KB Output is correct
67 Correct 80 ms 8328 KB Output is correct
68 Correct 71 ms 8396 KB Output is correct
69 Correct 67 ms 8396 KB Output is correct
70 Correct 52 ms 8304 KB Output is correct