oj.uz

Submission #446637

# Submission time Handle Problem Language Result Execution time Memory
446637 2021-07-22T21:48:20 Z ritul_kr_singh Meetings 2 (JOI21_meetings2) C++17
100 / 100
 1347 ms 23164 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'
 
const int LIM = 2e5+2, INF = 1e9;

struct FenwickTree{
	vector<int> a; int n, s;
	FenwickTree(int N) : a((n=N)+1, -INF) {}
	void update(int i, int v){
		i = n - i;
		for(; i<=n; i+=i&-i) a[i] = max(a[i], v);
	}
	int operator()(int i){
		i = n - i, s = -INF;
		for(; i>=1; i-=i&-i) s = max(s, a[i]);
		return s;
	}
};
 
int n, ans[LIM], s[LIM], mxSz;
vector<int> g[LIM];
bool r[LIM], update;
FenwickTree f(0);
 
void init(int u){
	s[u] = 1;
	for(int v : g[u]) if(!s[v]) init(v), s[u] += s[v];
}
 
int find(int u){
	for(int v : g[u]) if(!r[v] && s[v] > s[u]/2){
		s[u] -= s[v], s[v] += s[u];
		return find(v);
	}
	return u;
}
 
void dfs(int u, int d){
	if(update) f.update(s[u], d);
	else ans[s[u]] = max(ans[s[u]], f(s[u]) + d);
	if(s[u] <= mxSz) ans[s[u]] = max(ans[s[u]], d);
 
	for(int v : g[u]) if(!r[v] && s[v] < s[u]) dfs(v, d+1);
}
 
void calc(int u){
	f = FenwickTree(s[u] + 1);

	for(int v : g[u]) if(!r[v]){
		ans[s[v]+1] = max(ans[s[v]+1], f(s[v]+1));
 
		mxSz = s[u] - s[v];
 
		update = 0;
		dfs(v, 1);
		update = 1;
		dfs(v, 1);
	}
}
 
void decompose(int u){
	r[u = find(u)] = 1;
	calc(u);
	reverse(g[u].begin(), g[u].end());
	calc(u);
 
	for(int v : g[u]) if(!r[v]) decompose(v);
}
 
signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> n;
	for(int i=1; i<n; ++i){
		int u, v; cin >> u >> v;
		--u, --v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
 
	init(0);
	decompose(0);
 
	for(int i=n; --i; ) ans[i] = max(ans[i], ans[i+1]);
	for(int i=1; i<=n; ++i){
		if(i & 1) cout << 1 nl;
		else cout << ans[i/2]+1 nl;
	}
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4972 KB Output is correct
7 Correct 4 ms 4996 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4972 KB Output is correct
7 Correct 4 ms 4996 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 8 ms 5196 KB Output is correct
23 Correct 8 ms 5284 KB Output is correct
24 Correct 8 ms 5196 KB Output is correct
25 Correct 8 ms 5196 KB Output is correct
26 Correct 8 ms 5196 KB Output is correct
27 Correct 8 ms 5196 KB Output is correct
28 Correct 8 ms 5196 KB Output is correct
29 Correct 8 ms 5196 KB Output is correct
30 Correct 8 ms 5196 KB Output is correct
31 Correct 8 ms 5196 KB Output is correct
32 Correct 10 ms 5324 KB Output is correct
33 Correct 10 ms 5324 KB Output is correct
34 Correct 7 ms 5196 KB Output is correct
35 Correct 5 ms 5196 KB Output is correct
36 Correct 8 ms 5324 KB Output is correct
37 Correct 6 ms 5224 KB Output is correct
38 Correct 7 ms 5324 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4972 KB Output is correct
7 Correct 4 ms 4996 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 4 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 4 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 8 ms 5196 KB Output is correct
23 Correct 8 ms 5284 KB Output is correct
24 Correct 8 ms 5196 KB Output is correct
25 Correct 8 ms 5196 KB Output is correct
26 Correct 8 ms 5196 KB Output is correct
27 Correct 8 ms 5196 KB Output is correct
28 Correct 8 ms 5196 KB Output is correct
29 Correct 8 ms 5196 KB Output is correct
30 Correct 8 ms 5196 KB Output is correct
31 Correct 8 ms 5196 KB Output is correct
32 Correct 10 ms 5324 KB Output is correct
33 Correct 10 ms 5324 KB Output is correct
34 Correct 7 ms 5196 KB Output is correct
35 Correct 5 ms 5196 KB Output is correct
36 Correct 8 ms 5324 KB Output is correct
37 Correct 6 ms 5224 KB Output is correct
38 Correct 7 ms 5324 KB Output is correct
39 Correct 804 ms 17684 KB Output is correct
40 Correct 736 ms 17120 KB Output is correct
41 Correct 745 ms 17396 KB Output is correct
42 Correct 837 ms 17656 KB Output is correct
43 Correct 747 ms 17588 KB Output is correct
44 Correct 771 ms 17608 KB Output is correct
45 Correct 1347 ms 21124 KB Output is correct
46 Correct 996 ms 23164 KB Output is correct
47 Correct 287 ms 17076 KB Output is correct
48 Correct 170 ms 17540 KB Output is correct
49 Correct 722 ms 18192 KB Output is correct
50 Correct 259 ms 18148 KB Output is correct
51 Correct 692 ms 22000 KB Output is correct