Submission #712111

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
712111	2023-03-18T06:55:25 Z	Sohsoh84	Cat in a tree (BOI17_catinatree)	C++17	100 / 100	129 ms	40656 KB

catinatree

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define all(x)			(x).begin(),(x).end()
#define X			first
#define Y			second
#define sep			' '
#define endl			'\n'
#define debug(x)		cerr << #x << ": " <<  x << endl;

const ll MAXN = 1e6 + 10;

int D[MAXN], dp[MAXN], n, d;
vector<int> adj[MAXN];

// check n == 1

void dfs(int v, int p) {
	if (adj[v].size() == 1 && p) {
		D[v] = 0;
		dp[v] = 1;
		return;
	}
	
	D[v] = MAXN;
	int mn = MAXN, mx = -1;

	for (int u : adj[v]) {
		if (u == p) continue;
		dfs(u, v);

		int td = D[u] + 1;
		if (2 * td >= d) {
			mn = min(mn, td);
			dp[v] += dp[u];
			D[v] = min(D[v], td);
		} else {
			dp[v] += dp[u] - 1;
			mx = max(mx, td);
		}
	}
	
	if (mx > -1 && mx + mn >= d) {
		dp[v]++;
		D[v] = min(D[v], mx);
	}

	if (D[v] >= d) dp[v]++, D[v] = 0;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n >> d;
	if (n == 1) return cout << 1 << endl, 0;
	
	for (int i = 1; i < n; i++) {
		int v;
		cin >> v;
		adj[i + 1].push_back(v + 1);
		adj[v + 1].push_back(i + 1);
	}

	dfs(1, 0);
	cout << dp[1] << endl;
	return 0;
}

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	23820 KB	Output is correct
2	Correct	14 ms	23820 KB	Output is correct
3	Correct	14 ms	23812 KB	Output is correct
4	Correct	13 ms	23748 KB	Output is correct
5	Correct	13 ms	23728 KB	Output is correct
6	Correct	13 ms	23764 KB	Output is correct
7	Correct	13 ms	23764 KB	Output is correct
8	Correct	15 ms	23812 KB	Output is correct
9	Correct	14 ms	23764 KB	Output is correct
10	Correct	13 ms	23816 KB	Output is correct
11	Correct	16 ms	23824 KB	Output is correct
12	Correct	13 ms	23720 KB	Output is correct
13	Correct	13 ms	23828 KB	Output is correct
14	Correct	14 ms	23764 KB	Output is correct
15	Correct	13 ms	23820 KB	Output is correct
16	Correct	13 ms	23764 KB	Output is correct
17	Correct	13 ms	23764 KB	Output is correct
18	Correct	13 ms	23796 KB	Output is correct
19	Correct	13 ms	23764 KB	Output is correct
20	Correct	13 ms	23816 KB	Output is correct

Subtask #2
40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	23820 KB	Output is correct
2	Correct	14 ms	23820 KB	Output is correct
3	Correct	14 ms	23812 KB	Output is correct
4	Correct	13 ms	23748 KB	Output is correct
5	Correct	13 ms	23728 KB	Output is correct
6	Correct	13 ms	23764 KB	Output is correct
7	Correct	13 ms	23764 KB	Output is correct
8	Correct	15 ms	23812 KB	Output is correct
9	Correct	14 ms	23764 KB	Output is correct
10	Correct	13 ms	23816 KB	Output is correct
11	Correct	16 ms	23824 KB	Output is correct
12	Correct	13 ms	23720 KB	Output is correct
13	Correct	13 ms	23828 KB	Output is correct
14	Correct	14 ms	23764 KB	Output is correct
15	Correct	13 ms	23820 KB	Output is correct
16	Correct	13 ms	23764 KB	Output is correct
17	Correct	13 ms	23764 KB	Output is correct
18	Correct	13 ms	23796 KB	Output is correct
19	Correct	13 ms	23764 KB	Output is correct
20	Correct	13 ms	23816 KB	Output is correct
21	Correct	14 ms	23964 KB	Output is correct
22	Correct	14 ms	23768 KB	Output is correct
23	Correct	13 ms	23812 KB	Output is correct
24	Correct	13 ms	23764 KB	Output is correct
25	Correct	14 ms	23764 KB	Output is correct
26	Correct	14 ms	23764 KB	Output is correct
27	Correct	15 ms	23764 KB	Output is correct
28	Correct	13 ms	23860 KB	Output is correct
29	Correct	13 ms	23892 KB	Output is correct
30	Correct	13 ms	23820 KB	Output is correct
31	Correct	17 ms	23768 KB	Output is correct
32	Correct	13 ms	23892 KB	Output is correct
33	Correct	15 ms	23840 KB	Output is correct
34	Correct	15 ms	23892 KB	Output is correct
35	Correct	14 ms	23892 KB	Output is correct
36	Correct	13 ms	23892 KB	Output is correct
37	Correct	13 ms	23876 KB	Output is correct
38	Correct	15 ms	23920 KB	Output is correct
39	Correct	13 ms	23904 KB	Output is correct
40	Correct	13 ms	23948 KB	Output is correct

Subtask #3
49.0 / 49.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	23820 KB	Output is correct
2	Correct	14 ms	23820 KB	Output is correct
3	Correct	14 ms	23812 KB	Output is correct
4	Correct	13 ms	23748 KB	Output is correct
5	Correct	13 ms	23728 KB	Output is correct
6	Correct	13 ms	23764 KB	Output is correct
7	Correct	13 ms	23764 KB	Output is correct
8	Correct	15 ms	23812 KB	Output is correct
9	Correct	14 ms	23764 KB	Output is correct
10	Correct	13 ms	23816 KB	Output is correct
11	Correct	16 ms	23824 KB	Output is correct
12	Correct	13 ms	23720 KB	Output is correct
13	Correct	13 ms	23828 KB	Output is correct
14	Correct	14 ms	23764 KB	Output is correct
15	Correct	13 ms	23820 KB	Output is correct
16	Correct	13 ms	23764 KB	Output is correct
17	Correct	13 ms	23764 KB	Output is correct
18	Correct	13 ms	23796 KB	Output is correct
19	Correct	13 ms	23764 KB	Output is correct
20	Correct	13 ms	23816 KB	Output is correct
21	Correct	14 ms	23964 KB	Output is correct
22	Correct	14 ms	23768 KB	Output is correct
23	Correct	13 ms	23812 KB	Output is correct
24	Correct	13 ms	23764 KB	Output is correct
25	Correct	14 ms	23764 KB	Output is correct
26	Correct	14 ms	23764 KB	Output is correct
27	Correct	15 ms	23764 KB	Output is correct
28	Correct	13 ms	23860 KB	Output is correct
29	Correct	13 ms	23892 KB	Output is correct
30	Correct	13 ms	23820 KB	Output is correct
31	Correct	17 ms	23768 KB	Output is correct
32	Correct	13 ms	23892 KB	Output is correct
33	Correct	15 ms	23840 KB	Output is correct
34	Correct	15 ms	23892 KB	Output is correct
35	Correct	14 ms	23892 KB	Output is correct
36	Correct	13 ms	23892 KB	Output is correct
37	Correct	13 ms	23876 KB	Output is correct
38	Correct	15 ms	23920 KB	Output is correct
39	Correct	13 ms	23904 KB	Output is correct
40	Correct	13 ms	23948 KB	Output is correct
41	Correct	62 ms	32392 KB	Output is correct
42	Correct	39 ms	28364 KB	Output is correct
43	Correct	46 ms	28364 KB	Output is correct
44	Correct	42 ms	28364 KB	Output is correct
45	Correct	60 ms	28376 KB	Output is correct
46	Correct	129 ms	32972 KB	Output is correct
47	Correct	89 ms	33008 KB	Output is correct
48	Correct	91 ms	32944 KB	Output is correct
49	Correct	92 ms	33008 KB	Output is correct
50	Correct	35 ms	28640 KB	Output is correct
51	Correct	32 ms	28536 KB	Output is correct
52	Correct	29 ms	28628 KB	Output is correct
53	Correct	43 ms	33360 KB	Output is correct
54	Correct	43 ms	33348 KB	Output is correct
55	Correct	45 ms	33356 KB	Output is correct
56	Correct	14 ms	23912 KB	Output is correct
57	Correct	18 ms	26324 KB	Output is correct
58	Correct	36 ms	35272 KB	Output is correct
59	Correct	85 ms	40656 KB	Output is correct
60	Correct	61 ms	32576 KB	Output is correct
61	Correct	66 ms	32332 KB	Output is correct

Submission #712111

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