oj.uz

Submission #523296

# Submission time Handle Problem Language Result Execution time Memory
523296 2022-02-07T10:47:57 Z amunduzbaev Meetings 2 (JOI21_meetings2) C++17
20 / 100
 4000 ms 136236 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array

const int N = 2e5 + 5;
vector<int> edges[N], tt;
int sub[N], n, C, d[N];
int used[N], ss[N], rr[N];

void dff(int u, int p = -1){
	ss[u] = 1;
	for(auto x : edges[u]){
		if(x == p) continue;
		dff(x, u);
		ss[u] += ss[x];
	}
}

void dfs(int u, int n, int p = -1){
	sub[u] = 1;
	if(p == -1) d[u] = 0;
	for(auto x : edges[u]){
		if(x == p) continue;
		if(!used[x]){
			d[x] = d[u] + 1;
			dfs(x, n, u);
			sub[u] += sub[x];
		} else {
			if(ss[u] > ss[x]) sub[u] += ss[x];
			else sub[u] += (::n - ss[u]);
		}
	}
	if(sub[u] > n / 2 && C == -1) C = u;
}

void get(int u, int p = -1){
	tt.push_back(u);
	for(auto x : edges[u]){
		if(used[x] || x == p) continue;
		get(x, u);
	}
}

void dec(int u, int n){
	C = -1;
	dfs(u, n), dfs(C, n);
	//~ cout<<C<<endl;
	
	set<ar<int, 2>> ss;
	
	auto add = [&](ar<int, 2> x){
		auto it = ss.lower_bound({x[0] + 1, -1});
		if(it != ss.end()){
			if((*it)[1] >= x[1]) return;;
		}
		
		vector<ar<int, 2>> del;
		while(it != ss.begin()){
			it--;
			if((*it)[1] <= x[1]) del.push_back(*it);
			else break;
		}
		
		for(auto v : del) ss.erase(v);
		ss.insert(x);
	};
	
	for(auto x : edges[C]){
		if(used[x]) continue;
		tt.clear(); get(x, C);
		for(auto x : tt){
			auto it = ss.lower_bound({sub[x], -1});
			if(it != ss.end()){
				rr[sub[x]] = max(rr[sub[x]], d[x] + (*it)[1] + 1);
			}
		} for(auto x : tt) add({sub[x], d[x]});
	}
	
	reverse(edges[C].begin(), edges[C].end());
	ss.clear();
	for(auto x : edges[C]){
		if(used[x]) continue;
		tt.clear(); get(x, C);
		for(auto x : tt){
			auto it = ss.lower_bound({sub[x], -1});
			if(it != ss.end()){
				rr[sub[x]] = max(rr[sub[x]], d[x] + (*it)[1] + 1);
			}
			
			rr[min(sub[x], n - (int)tt.size())] = 
			max(rr[min(sub[x], n - (int)tt.size())], d[x] + 1);
		} for(auto x : tt) add({sub[x], d[x]});
	}
	
	used[C] = 1;
	for(auto x : edges[C]){
		if(used[x]) continue;
		tt.clear(); get(x, C);
		dec(x, (int)tt.size());
	}
}

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	cin>>n;
	for(int i=1;i<n;i++){
		int a, b; cin>>a>>b;
		edges[a].push_back(b);
		edges[b].push_back(a);
	}
	
	dff(1);
	dec(1, n);
	rr[n] = 1;
	for(int i=n;i>0;i--) rr[i] = max(rr[i], rr[i+1]);
	for(int i=1;i<=n;i++){
		if(i&1) cout<<1<<"\n";
		else cout<<rr[i/2]<<"\n";
	}
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5028 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 5 ms 5020 KB Output is correct
6 Correct 5 ms 5024 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 4 ms 5024 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4968 KB Output is correct
11 Correct 3 ms 5028 KB Output is correct
12 Correct 4 ms 5020 KB Output is correct
13 Correct 5 ms 5016 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 2 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 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 5024 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5028 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 5 ms 5020 KB Output is correct
6 Correct 5 ms 5024 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 4 ms 5024 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4968 KB Output is correct
11 Correct 3 ms 5028 KB Output is correct
12 Correct 4 ms 5020 KB Output is correct
13 Correct 5 ms 5016 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 2 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 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 5024 KB Output is correct
22 Correct 10 ms 5288 KB Output is correct
23 Correct 10 ms 5288 KB Output is correct
24 Correct 9 ms 5292 KB Output is correct
25 Correct 10 ms 5296 KB Output is correct
26 Correct 10 ms 5312 KB Output is correct
27 Correct 9 ms 5196 KB Output is correct
28 Correct 9 ms 5324 KB Output is correct
29 Correct 9 ms 5288 KB Output is correct
30 Correct 9 ms 5288 KB Output is correct
31 Correct 10 ms 5196 KB Output is correct
32 Correct 241 ms 13992 KB Output is correct
33 Correct 401 ms 29016 KB Output is correct
34 Correct 5 ms 5196 KB Output is correct
35 Correct 5 ms 5220 KB Output is correct
36 Correct 16 ms 5356 KB Output is correct
37 Correct 6 ms 5324 KB Output is correct
38 Correct 109 ms 11332 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5028 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 4 ms 4940 KB Output is correct
4 Correct 4 ms 4940 KB Output is correct
5 Correct 5 ms 5020 KB Output is correct
6 Correct 5 ms 5024 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 4 ms 5024 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4968 KB Output is correct
11 Correct 3 ms 5028 KB Output is correct
12 Correct 4 ms 5020 KB Output is correct
13 Correct 5 ms 5016 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 2 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 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 5024 KB Output is correct
22 Correct 10 ms 5288 KB Output is correct
23 Correct 10 ms 5288 KB Output is correct
24 Correct 9 ms 5292 KB Output is correct
25 Correct 10 ms 5296 KB Output is correct
26 Correct 10 ms 5312 KB Output is correct
27 Correct 9 ms 5196 KB Output is correct
28 Correct 9 ms 5324 KB Output is correct
29 Correct 9 ms 5288 KB Output is correct
30 Correct 9 ms 5288 KB Output is correct
31 Correct 10 ms 5196 KB Output is correct
32 Correct 241 ms 13992 KB Output is correct
33 Correct 401 ms 29016 KB Output is correct
34 Correct 5 ms 5196 KB Output is correct
35 Correct 5 ms 5220 KB Output is correct
36 Correct 16 ms 5356 KB Output is correct
37 Correct 6 ms 5324 KB Output is correct
38 Correct 109 ms 11332 KB Output is correct
39 Correct 746 ms 18552 KB Output is correct
40 Correct 742 ms 18168 KB Output is correct
41 Correct 797 ms 18560 KB Output is correct
42 Correct 757 ms 18816 KB Output is correct
43 Correct 758 ms 18696 KB Output is correct
44 Correct 792 ms 18704 KB Output is correct
45 Execution timed out 4057 ms 136236 KB Time limit exceeded
46 Halted 0 ms 0 KB -