oj.uz

답안 #446631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
446631 2021-07-22T21:35:44 Z ritul_kr_singh Meetings 2 (JOI21_meetings2) C++17
100 / 100
 2637 ms 27272 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'

const int LIM = 2e5+2, INF = 1e9;

template<class T> struct SegmentTree{
	const T ID = -INF;
	int n, i; vector<T> a;
	SegmentTree(int N) : a((n=N)*2, ID) {}
	SegmentTree& operator[](int j){ i=j+n; return *this; }
	void operator=(T v){
		for(a[i]=v; i/=2; ) a[i] = max(a[2*i], a[2*i+1]); }
	int operator()(int l, int r){
		T x = ID;
		for(l+=n, r+=n+1; l<r; l/=2, r/=2){
			if(l & 1) x = max(x, a[l++]);
			if(r & 1) x = max(x, a[--r]);
		}
		return x;
	}
};

int n, ans[LIM], s[LIM], mxSz;
vector<int> g[LIM];
bool r[LIM], update;
SegmentTree<int> st(LIM);

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) st[s[u]] = max(st(s[u], s[u]), d);
	else ans[s[u]] = max(ans[s[u]], st(s[u], n-1) + 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){
	for(int v : g[u]) if(!r[v]){
		ans[s[v]+1] = max(ans[s[v]+1], st(s[v]+1, n-1));

		mxSz = s[u] - s[v];

		update = 0;
		dfs(v, 1);
		update = 1;
		dfs(v, 1);
	}

	for(int i=0; i<s[u]; ++i) st[i+1] = -INF;
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8140 KB Output is correct
2 Correct 6 ms 8140 KB Output is correct
3 Correct 5 ms 8140 KB Output is correct
4 Correct 5 ms 8140 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8140 KB Output is correct
7 Correct 5 ms 8172 KB Output is correct
8 Correct 5 ms 8140 KB Output is correct
9 Correct 5 ms 8140 KB Output is correct
10 Correct 5 ms 8140 KB Output is correct
11 Correct 5 ms 8140 KB Output is correct
12 Correct 5 ms 8140 KB Output is correct
13 Correct 6 ms 8140 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 6 ms 8056 KB Output is correct
16 Correct 5 ms 8140 KB Output is correct
17 Correct 5 ms 8168 KB Output is correct
18 Correct 6 ms 8140 KB Output is correct
19 Correct 5 ms 8140 KB Output is correct
20 Correct 5 ms 8140 KB Output is correct
21 Correct 5 ms 8140 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8140 KB Output is correct
2 Correct 6 ms 8140 KB Output is correct
3 Correct 5 ms 8140 KB Output is correct
4 Correct 5 ms 8140 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8140 KB Output is correct
7 Correct 5 ms 8172 KB Output is correct
8 Correct 5 ms 8140 KB Output is correct
9 Correct 5 ms 8140 KB Output is correct
10 Correct 5 ms 8140 KB Output is correct
11 Correct 5 ms 8140 KB Output is correct
12 Correct 5 ms 8140 KB Output is correct
13 Correct 6 ms 8140 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 6 ms 8056 KB Output is correct
16 Correct 5 ms 8140 KB Output is correct
17 Correct 5 ms 8168 KB Output is correct
18 Correct 6 ms 8140 KB Output is correct
19 Correct 5 ms 8140 KB Output is correct
20 Correct 5 ms 8140 KB Output is correct
21 Correct 5 ms 8140 KB Output is correct
22 Correct 20 ms 8404 KB Output is correct
23 Correct 19 ms 8404 KB Output is correct
24 Correct 20 ms 8408 KB Output is correct
25 Correct 20 ms 8396 KB Output is correct
26 Correct 22 ms 8396 KB Output is correct
27 Correct 19 ms 8392 KB Output is correct
28 Correct 22 ms 8396 KB Output is correct
29 Correct 20 ms 8404 KB Output is correct
30 Correct 19 ms 8404 KB Output is correct
31 Correct 19 ms 8404 KB Output is correct
32 Correct 29 ms 8472 KB Output is correct
33 Correct 29 ms 8524 KB Output is correct
34 Correct 11 ms 8396 KB Output is correct
35 Correct 10 ms 8316 KB Output is correct
36 Correct 22 ms 8396 KB Output is correct
37 Correct 13 ms 8416 KB Output is correct
38 Correct 21 ms 8468 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8140 KB Output is correct
2 Correct 6 ms 8140 KB Output is correct
3 Correct 5 ms 8140 KB Output is correct
4 Correct 5 ms 8140 KB Output is correct
5 Correct 5 ms 8140 KB Output is correct
6 Correct 5 ms 8140 KB Output is correct
7 Correct 5 ms 8172 KB Output is correct
8 Correct 5 ms 8140 KB Output is correct
9 Correct 5 ms 8140 KB Output is correct
10 Correct 5 ms 8140 KB Output is correct
11 Correct 5 ms 8140 KB Output is correct
12 Correct 5 ms 8140 KB Output is correct
13 Correct 6 ms 8140 KB Output is correct
14 Correct 5 ms 8140 KB Output is correct
15 Correct 6 ms 8056 KB Output is correct
16 Correct 5 ms 8140 KB Output is correct
17 Correct 5 ms 8168 KB Output is correct
18 Correct 6 ms 8140 KB Output is correct
19 Correct 5 ms 8140 KB Output is correct
20 Correct 5 ms 8140 KB Output is correct
21 Correct 5 ms 8140 KB Output is correct
22 Correct 20 ms 8404 KB Output is correct
23 Correct 19 ms 8404 KB Output is correct
24 Correct 20 ms 8408 KB Output is correct
25 Correct 20 ms 8396 KB Output is correct
26 Correct 22 ms 8396 KB Output is correct
27 Correct 19 ms 8392 KB Output is correct
28 Correct 22 ms 8396 KB Output is correct
29 Correct 20 ms 8404 KB Output is correct
30 Correct 19 ms 8404 KB Output is correct
31 Correct 19 ms 8404 KB Output is correct
32 Correct 29 ms 8472 KB Output is correct
33 Correct 29 ms 8524 KB Output is correct
34 Correct 11 ms 8396 KB Output is correct
35 Correct 10 ms 8316 KB Output is correct
36 Correct 22 ms 8396 KB Output is correct
37 Correct 13 ms 8416 KB Output is correct
38 Correct 21 ms 8468 KB Output is correct
39 Correct 1585 ms 21636 KB Output is correct
40 Correct 1538 ms 21316 KB Output is correct
41 Correct 1517 ms 21776 KB Output is correct
42 Correct 1495 ms 21964 KB Output is correct
43 Correct 1528 ms 21852 KB Output is correct
44 Correct 1495 ms 21976 KB Output is correct
45 Correct 2637 ms 25132 KB Output is correct
46 Correct 2618 ms 27272 KB Output is correct
47 Correct 416 ms 21872 KB Output is correct
48 Correct 302 ms 22128 KB Output is correct
49 Correct 1735 ms 22032 KB Output is correct
50 Correct 513 ms 22256 KB Output is correct
51 Correct 1402 ms 26100 KB Output is correct