oj.uz

답안 #630605

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
630605 2022-08-16T16:03:11 Z valerikk Meetings 2 (JOI21_meetings2) C++17
100 / 100
 866 ms 33420 KB 
#include <bits/stdc++.h>

using namespace std;

#define x first
#define y second
#define all(a) begin(a), end(a)
#define sz(a) ((int) (a).size())

using ll = long long;

const int N = 200005;

int n;
vector<int> g[N];
int init_sz[N], init_d[N];
bool used[N];
int sz[N], d[N];
int ans[N], first[N];

void upd_ans(int x, int y) {
	ans[2 * x] = max(ans[2 * x], y);
}

void dfs_prepare(int u = 0, int p = -1, int cd = 0) {
	init_sz[u] = 1;
	init_d[u] = cd;
	for (int v : g[u]) {
		if (v != p) {
			dfs_prepare(v, u, cd + 1);
			init_sz[u] += init_sz[v];
		}
	}
}	

int get_subtree_sz(int u, int v) {
	return init_d[u] < init_d[v] ? init_sz[v] : n - init_sz[u];
}

void dfs(int u, int p = -1, int cd = 0) {
	sz[u] = 1;
	d[u] = cd;
	for (int v : g[u]) {
		if (!used[v] && v != p) {
			dfs(v, u, cd + 1);
			sz[u] += sz[v];
		}
	}
}

int centr(int all_sz, int u, int p = -1) {
	for (int v : g[u]) {
		if (!used[v] && v != p && 2 * sz[v] > all_sz) {
			return centr(all_sz, v, u);
		}
	}
	return u;
}

void dfs_ans(int root, vector<pair<int, int>> &vs, int u, int p = -1) {
	if (u != root) {
		first[u] = p == root ? u : first[p];
		vs.push_back({get_subtree_sz(p, u), u});
		upd_ans(min(get_subtree_sz(p, u), get_subtree_sz(first[u], root)), d[u] + 1);
	}
	for (int v : g[u]) {
		if (!used[v] && v != p) {
			dfs_ans(root, vs, v, u);
		} 
	}
}

void solve(int root) {
	dfs(root);
	vector<pair<int, int>> vs;
	dfs_ans(root, vs, root);
	sort(all(vs));
	reverse(all(vs));
	vector<pair<int, int>> cur;
	for (auto [s, v] : vs) {
		for (auto [du, fu] : cur) {
			if (fu != first[v]) {
				upd_ans(s, du + d[v] + 1);
			}
		}	
		cur.push_back({d[v], first[v]});
		sort(all(cur));
		bool cont = true;
		for (int i = 0; i < sz(cur) && cont; ++i) {
			for (int j = i + 1; j < sz(cur) && cont; ++j) {
				if (cur[i].y == cur[j].y) {
					cur.erase(begin(cur) + i);
					cont = false;
				}
			}
		}
		if (sz(cur) == 3) {
			cur.erase(begin(cur));
		}
	}
	used[root] = true;
	for (int v : g[root]) {
		if (!used[v]) {
			solve(centr(sz[v], v));
		}
	}
}


int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	for (int i = 0; i < n - 1; ++i) {
		int a, b;
		cin >> a >> b;
		--a, --b;
		g[a].push_back(b);
		g[b].push_back(a);
	}	
	for (int i = 1; i <= n; ++i) {
		ans[i] = 1;
	}
	dfs_prepare();
	dfs(0);
	solve(centr(n, 0));
	for (int i = n; i >= 2; --i) {
		ans[i - 2] = max(ans[i - 2], ans[i]);
	}
	for (int i = 1; i <= n; ++i) {
		cout << ans[i] << "\n";
	}
	return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5020 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5028 KB Output is correct
6 Correct 4 ms 5072 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 3 ms 5020 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4972 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5024 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 4948 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5020 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5028 KB Output is correct
6 Correct 4 ms 5072 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 3 ms 5020 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4972 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5024 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 4948 KB Output is correct
22 Correct 7 ms 5288 KB Output is correct
23 Correct 9 ms 5344 KB Output is correct
24 Correct 8 ms 5332 KB Output is correct
25 Correct 7 ms 5332 KB Output is correct
26 Correct 8 ms 5296 KB Output is correct
27 Correct 7 ms 5288 KB Output is correct
28 Correct 7 ms 5332 KB Output is correct
29 Correct 9 ms 5400 KB Output is correct
30 Correct 7 ms 5384 KB Output is correct
31 Correct 7 ms 5332 KB Output is correct
32 Correct 9 ms 5516 KB Output is correct
33 Correct 8 ms 5588 KB Output is correct
34 Correct 5 ms 5388 KB Output is correct
35 Correct 4 ms 5332 KB Output is correct
36 Correct 8 ms 5356 KB Output is correct
37 Correct 5 ms 5332 KB Output is correct
38 Correct 7 ms 5424 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5020 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5028 KB Output is correct
6 Correct 4 ms 5072 KB Output is correct
7 Correct 3 ms 5024 KB Output is correct
8 Correct 3 ms 5020 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4972 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 5024 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 4 ms 4948 KB Output is correct
22 Correct 7 ms 5288 KB Output is correct
23 Correct 9 ms 5344 KB Output is correct
24 Correct 8 ms 5332 KB Output is correct
25 Correct 7 ms 5332 KB Output is correct
26 Correct 8 ms 5296 KB Output is correct
27 Correct 7 ms 5288 KB Output is correct
28 Correct 7 ms 5332 KB Output is correct
29 Correct 9 ms 5400 KB Output is correct
30 Correct 7 ms 5384 KB Output is correct
31 Correct 7 ms 5332 KB Output is correct
32 Correct 9 ms 5516 KB Output is correct
33 Correct 8 ms 5588 KB Output is correct
34 Correct 5 ms 5388 KB Output is correct
35 Correct 4 ms 5332 KB Output is correct
36 Correct 8 ms 5356 KB Output is correct
37 Correct 5 ms 5332 KB Output is correct
38 Correct 7 ms 5424 KB Output is correct
39 Correct 564 ms 22188 KB Output is correct
40 Correct 598 ms 22008 KB Output is correct
41 Correct 573 ms 21932 KB Output is correct
42 Correct 549 ms 22396 KB Output is correct
43 Correct 630 ms 22264 KB Output is correct
44 Correct 575 ms 22152 KB Output is correct
45 Correct 866 ms 28036 KB Output is correct
46 Correct 755 ms 33420 KB Output is correct
47 Correct 203 ms 21224 KB Output is correct
48 Correct 153 ms 21312 KB Output is correct
49 Correct 513 ms 23160 KB Output is correct
50 Correct 234 ms 22828 KB Output is correct
51 Correct 529 ms 30404 KB Output is correct