Submission #544733

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
544733	2022-04-02T16:14:41 Z	rainboy	Cat in a tree (BOI17_catinatree)	C	100 / 100	87 ms	21428 KB

catinatree

#include <stdio.h>
#include <stdlib.h>

#define N	200000
#define INF	0x3f3f3f3f

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

int *oj[N], oo[N];

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

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

int dp[N], dd1[N], dd2[N], d_;

void dfs(int i) {
	int o, d1, d2;

	d1 = -1, d2 = INF;
	for (o = 0; o < oo[i]; o++) {
		int j = oj[i][o];

		dfs(j);
		dp[i] += dp[j];
		if (dd1[j] != INF)
			dp[i]--, d1 = max(d1, dd1[j]);
		d2 = min(d2, dd2[j]);
	}
	if (d1 != -1 && d1 + d2 >= d_)
		dp[i]++, dd1[i] = d1, dd2[i] = d2;
	else
		dd1[i] = INF, dd2[i] = d2;
	if (dd1[i] >= d_ && dd2[i] >= d_)
		dp[i]++, dd1[i] = 0, dd2[i] = INF;
	if (dd1[i] != INF)
		dd1[i]++;
	if (dd2[i] != INF)
		dd2[i]++;
	if (dd1[i] * 2 >= d_)
		dd2[i] = min(dd2[i], dd1[i]), dd1[i] = INF;
}

int main() {
	int n, i;

	scanf("%d%d", &n, &d_);
	for (i = 0; i < n; i++)
		oj[i] = (int *) malloc(2 * sizeof *oj[i]);
	for (i = 1; i < n; i++) {
		int p;

		scanf("%d", &p);
		append(p, i);
	}
	dfs(0);
	printf("%d\n", dp[0]);
	return 0;
}

Compilation message

catinatree.c: In function 'append':
catinatree.c:15:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   15 |  if (o >= 2 && (o & o - 1) == 0)
      |                     ~~^~~
catinatree.c: In function 'main':
catinatree.c:52:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |  scanf("%d%d", &n, &d_);
      |  ^~~~~~~~~~~~~~~~~~~~~~
catinatree.c:58:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |   scanf("%d", &p);
      |   ^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	292 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	288 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	288 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	284 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	292 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	296 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	1 ms	424 KB	Output is correct

Subtask #3
49.0 / 49.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	292 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	288 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	288 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	284 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	292 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	296 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	1 ms	424 KB	Output is correct
41	Correct	40 ms	11956 KB	Output is correct
42	Correct	26 ms	6348 KB	Output is correct
43	Correct	24 ms	6416 KB	Output is correct
44	Correct	23 ms	6448 KB	Output is correct
45	Correct	35 ms	6348 KB	Output is correct
46	Correct	85 ms	12728 KB	Output is correct
47	Correct	87 ms	12620 KB	Output is correct
48	Correct	61 ms	12636 KB	Output is correct
49	Correct	61 ms	12632 KB	Output is correct
50	Correct	15 ms	6356 KB	Output is correct
51	Correct	15 ms	6320 KB	Output is correct
52	Correct	16 ms	6332 KB	Output is correct
53	Correct	33 ms	12324 KB	Output is correct
54	Correct	32 ms	12284 KB	Output is correct
55	Correct	44 ms	12248 KB	Output is correct
56	Correct	1 ms	468 KB	Output is correct
57	Correct	6 ms	3396 KB	Output is correct
58	Correct	25 ms	14716 KB	Output is correct
59	Correct	52 ms	21428 KB	Output is correct
60	Correct	38 ms	12168 KB	Output is correct
61	Correct	44 ms	11816 KB	Output is correct

Submission #544733

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 40.0 / 40.0

Subtask #3 49.0 / 49.0

Subtask #1
11.0 / 11.0

Subtask #2
40.0 / 40.0

Subtask #3
49.0 / 49.0