oj.uz

Submission #862828

# Submission time Handle Problem Language Result Execution time Memory
862828 2023-10-19T05:15:08 Z SanguineChameleon Cat in a tree (BOI17_catinatree) C++17
100 / 100
 274 ms 40836 KB 
#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

const int inf = 1e9 + 20;
const int maxN = 2e5 + 20;
const int maxL = 20;
vector<int> adj[maxN];
bool done[maxN];
int dist[maxL][maxN];
int depth[maxN];
int par[maxN];
int sz[maxN];
int best[maxN];
pair<int, int> order[maxN];

void dfs_dist(int u, int p, int d) {
	for (auto v: adj[u]) {
		if (v != p && !done[v]) {
			dist[d][v] = dist[d][u] + 1;
			dfs_dist(v, u, d);
		}
	}
}

void dfs_size(int u, int p) {
	sz[u] = 1;
	for (auto v: adj[u]) {
		if (v != p && !done[v]) {
			dfs_size(v, u);
			sz[u] += sz[v];
		}
	}
}

int find_cen(int r, int u, int p) {
	for (auto v: adj[u]) {
		if (v != p && !done[v] && sz[v] * 2 > sz[r]) {
			return find_cen(r, v, u);
		}
	}
	return u;
}

void build(int u, int p, int d) {
	dfs_size(u, -1);
	u = find_cen(u, u, -1);
	par[u] = p;
	depth[u] = d;
	dist[d][u] = 0;
	dfs_dist(u, -1, d);
	done[u] = true;
	for (auto v: adj[u]) {
		if (!done[v]) {
			build(v, u, d + 1);
		}
	}
}

void just_do_it() {
	int N, D;
	cin >> N >> D;
	for (int v = 2; v <= N; v++) {
		int u;
		cin >> u;
		u++;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	dfs_dist(1, -1, 0);
	for (int i = 1; i <= N; i++) {
		order[i] = {dist[0][i], i};
	}
	sort(order + 1, order + N + 1, greater<pair<int, int>>());
	build(1, -1, 0);
	for (int i = 1; i <= N; i++) {
		best[i] = inf;
	}
	int res = 0;
	for (int i = 1; i <= N; i++) {
		int u = order[i].second;
		int min_D = inf;
		for (int d = depth[u], p = u; d >= 0; d--, p = par[p]) {
			min_D = min(min_D, best[p] + dist[d][u]);
		}
		if (min_D >= D) {
			res++;
			for (int d = depth[u], p = u; d >= 0; d--, p = par[p]) {
				best[p] = min(best[p], dist[d][u]);
			}
		}
	}
	cout << res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11100 KB Output is correct
2 Correct 2 ms 13184 KB Output is correct
3 Correct 3 ms 13208 KB Output is correct
4 Correct 2 ms 13208 KB Output is correct
5 Correct 2 ms 13148 KB Output is correct
6 Correct 2 ms 13148 KB Output is correct
7 Correct 2 ms 13144 KB Output is correct
8 Correct 2 ms 13148 KB Output is correct
9 Correct 2 ms 13152 KB Output is correct
10 Correct 2 ms 13148 KB Output is correct
11 Correct 3 ms 11160 KB Output is correct
12 Correct 2 ms 11104 KB Output is correct
13 Correct 2 ms 11104 KB Output is correct
14 Correct 2 ms 11104 KB Output is correct
15 Correct 2 ms 11164 KB Output is correct
16 Correct 2 ms 13204 KB Output is correct
17 Correct 2 ms 13148 KB Output is correct
18 Correct 2 ms 13144 KB Output is correct
19 Correct 2 ms 13148 KB Output is correct
20 Correct 2 ms 13148 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11100 KB Output is correct
2 Correct 2 ms 13184 KB Output is correct
3 Correct 3 ms 13208 KB Output is correct
4 Correct 2 ms 13208 KB Output is correct
5 Correct 2 ms 13148 KB Output is correct
6 Correct 2 ms 13148 KB Output is correct
7 Correct 2 ms 13144 KB Output is correct
8 Correct 2 ms 13148 KB Output is correct
9 Correct 2 ms 13152 KB Output is correct
10 Correct 2 ms 13148 KB Output is correct
11 Correct 3 ms 11160 KB Output is correct
12 Correct 2 ms 11104 KB Output is correct
13 Correct 2 ms 11104 KB Output is correct
14 Correct 2 ms 11104 KB Output is correct
15 Correct 2 ms 11164 KB Output is correct
16 Correct 2 ms 13204 KB Output is correct
17 Correct 2 ms 13148 KB Output is correct
18 Correct 2 ms 13144 KB Output is correct
19 Correct 2 ms 13148 KB Output is correct
20 Correct 2 ms 13148 KB Output is correct
21 Correct 4 ms 19548 KB Output is correct
22 Correct 3 ms 15196 KB Output is correct
23 Correct 3 ms 15196 KB Output is correct
24 Correct 3 ms 15196 KB Output is correct
25 Correct 4 ms 17252 KB Output is correct
26 Correct 3 ms 17252 KB Output is correct
27 Correct 3 ms 17252 KB Output is correct
28 Correct 4 ms 17252 KB Output is correct
29 Correct 3 ms 17432 KB Output is correct
30 Correct 4 ms 17252 KB Output is correct
31 Correct 3 ms 17316 KB Output is correct
32 Correct 3 ms 13156 KB Output is correct
33 Correct 2 ms 13148 KB Output is correct
34 Correct 3 ms 15448 KB Output is correct
35 Correct 3 ms 15196 KB Output is correct
36 Correct 3 ms 15384 KB Output is correct
37 Correct 3 ms 15196 KB Output is correct
38 Correct 4 ms 19356 KB Output is correct
39 Correct 4 ms 19292 KB Output is correct
40 Correct 4 ms 19800 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11100 KB Output is correct
2 Correct 2 ms 13184 KB Output is correct
3 Correct 3 ms 13208 KB Output is correct
4 Correct 2 ms 13208 KB Output is correct
5 Correct 2 ms 13148 KB Output is correct
6 Correct 2 ms 13148 KB Output is correct
7 Correct 2 ms 13144 KB Output is correct
8 Correct 2 ms 13148 KB Output is correct
9 Correct 2 ms 13152 KB Output is correct
10 Correct 2 ms 13148 KB Output is correct
11 Correct 3 ms 11160 KB Output is correct
12 Correct 2 ms 11104 KB Output is correct
13 Correct 2 ms 11104 KB Output is correct
14 Correct 2 ms 11104 KB Output is correct
15 Correct 2 ms 11164 KB Output is correct
16 Correct 2 ms 13204 KB Output is correct
17 Correct 2 ms 13148 KB Output is correct
18 Correct 2 ms 13144 KB Output is correct
19 Correct 2 ms 13148 KB Output is correct
20 Correct 2 ms 13148 KB Output is correct
21 Correct 4 ms 19548 KB Output is correct
22 Correct 3 ms 15196 KB Output is correct
23 Correct 3 ms 15196 KB Output is correct
24 Correct 3 ms 15196 KB Output is correct
25 Correct 4 ms 17252 KB Output is correct
26 Correct 3 ms 17252 KB Output is correct
27 Correct 3 ms 17252 KB Output is correct
28 Correct 4 ms 17252 KB Output is correct
29 Correct 3 ms 17432 KB Output is correct
30 Correct 4 ms 17252 KB Output is correct
31 Correct 3 ms 17316 KB Output is correct
32 Correct 3 ms 13156 KB Output is correct
33 Correct 2 ms 13148 KB Output is correct
34 Correct 3 ms 15448 KB Output is correct
35 Correct 3 ms 15196 KB Output is correct
36 Correct 3 ms 15384 KB Output is correct
37 Correct 3 ms 15196 KB Output is correct
38 Correct 4 ms 19356 KB Output is correct
39 Correct 4 ms 19292 KB Output is correct
40 Correct 4 ms 19800 KB Output is correct
41 Correct 63 ms 24312 KB Output is correct
42 Correct 81 ms 26264 KB Output is correct
43 Correct 79 ms 26192 KB Output is correct
44 Correct 74 ms 26280 KB Output is correct
45 Correct 79 ms 26260 KB Output is correct
46 Correct 230 ms 31060 KB Output is correct
47 Correct 265 ms 31056 KB Output is correct
48 Correct 274 ms 31032 KB Output is correct
49 Correct 268 ms 31276 KB Output is correct
50 Correct 54 ms 22444 KB Output is correct
51 Correct 43 ms 24236 KB Output is correct
52 Correct 41 ms 22276 KB Output is correct
53 Correct 176 ms 29520 KB Output is correct
54 Correct 147 ms 29672 KB Output is correct
55 Correct 104 ms 29520 KB Output is correct
56 Correct 5 ms 19548 KB Output is correct
57 Correct 13 ms 24156 KB Output is correct
58 Correct 64 ms 35164 KB Output is correct
59 Correct 232 ms 40836 KB Output is correct
60 Correct 63 ms 24708 KB Output is correct
61 Correct 98 ms 26368 KB Output is correct