oj.uz

Submission #386296

# Submission time Handle Problem Language Result Execution time Memory
386296 2021-04-06T09:55:03 Z kshitij_sodani Meetings 2 (JOI21_meetings2) C++14
100 / 100
 1566 ms 84324 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'

llo n;
llo aa,bb;
vector<llo> adj[2000001];

llo cur=-1;
llo ma[200001];
llo ne[200001];
llo ss[200001];
llo cot=0;
llo pre[200001];
llo vis[200001];
llo lev[200001];
vector<pair<llo,llo>> tt;
void dfs2(llo no,llo par2=-1,llo cot2=-1,llo levv=0){
	ss[no]=1;
	ne[no]=cot2;
	lev[no]=levv;
	for(auto j:adj[no]){
		if(vis[j]){
			continue;
		}
		if(j!=par2){
			if(par2==-1){
				cot2=j;
			}
			dfs2(j,no,cot2,levv+1);
			ss[no]+=ss[j];
		}
	}
	if(par2!=-1){
		tt.pb({ss[no],no});
	}	
}
llo pp;
llo find(llo no,llo par2=-1){
	for(auto j:adj[no]){
		if(vis[j]){
			continue;
		}
		if(ss[j]>(pp/2) and j!=par2){
			return find(j,no);
		}
	}

	return no;
}

void dec(llo no){

	dfs2(no,-1,no);
	pp=ss[no];
	no=find(no);
	tt.clear();
	dfs2(no);
	sort(tt.begin(),tt.end());

	reverse(tt.begin(),tt.end());
	//ma[no]=0;
	set<pair<llo,llo>> xx;
	//xx.insert({0,no});
	for(auto j:adj[no]){
		if(vis[j]==0){
			ma[j]=0;
			xx.insert({0,j});
		}
	}

	for(auto j:tt){
		xx.erase({-ma[ne[j.b]],ne[j.b]});
		ma[ne[j.b]]=max(ma[ne[j.b]],lev[j.b]);
		if(xx.size()){
			pair<llo,llo> cc=*(xx.begin());
			/*if(j.a==1){
				cout<<no<<":"<
			}*/
			pre[j.a]=max(pre[j.a],lev[j.b]-cc.a+1);
		}
		llo yy=n-ss[ne[j.b]];
		yy=min(yy,j.a);
		pre[yy]=max(pre[yy],lev[j.b]+1);
		xx.insert({-ma[ne[j.b]],ne[j.b]});
	}

	vis[no]=1;
	for(auto j:adj[no]){
		if(vis[j]==0){
			//cout<<no<<":"<<j<<endl;
			dec(j);

		}
	}
}
/*void dfs3(llo no,llo par2=-1,llo lev=0){
	if(par2!=-1){
		pre[min(ss[no],n-ss[ne[no]])]=max(pre[min(ss[no],n-ss[ne[no]])],lev+1);
	}
	for(auto j:adj[no]){
		if(j!=par2){
			dfs3(j,no,lev+1);
		}
	}
}*/
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;

	for(llo i=0;i<n-1;i++){
		cin>>aa>>bb;
		aa--;
		bb--;
		adj[aa].pb(bb);
		adj[bb].pb(aa);
	}
	dec(0);
	/*for(llo i=0;i<n;i++){
		dfs2(i);
		dfs3(i);
	}*/
	for(llo j=n-1;j>=0;j--){
		pre[j]=max(pre[j+1],pre[j]);
	}
/*	for(llo j=1;j<=n;j++){
		cout<<pre[j]<<",";
	}
	cout<<endl;*/
	for(llo j=1;j<=n;j++){
		if(j%2==1){
			cout<<1<<endl;
		}
		else{
			llo ans=1;
			cout<<max(pre[j/2],ans)<<endl;
		}
	}








 
	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47340 KB Output is correct
2 Correct 42 ms 47340 KB Output is correct
3 Correct 31 ms 47340 KB Output is correct
4 Correct 30 ms 47340 KB Output is correct
5 Correct 30 ms 47340 KB Output is correct
6 Correct 31 ms 47340 KB Output is correct
7 Correct 30 ms 47468 KB Output is correct
8 Correct 30 ms 47340 KB Output is correct
9 Correct 43 ms 47340 KB Output is correct
10 Correct 36 ms 47340 KB Output is correct
11 Correct 34 ms 47352 KB Output is correct
12 Correct 34 ms 47340 KB Output is correct
13 Correct 35 ms 47340 KB Output is correct
14 Correct 32 ms 47340 KB Output is correct
15 Correct 31 ms 47340 KB Output is correct
16 Correct 32 ms 47340 KB Output is correct
17 Correct 29 ms 47340 KB Output is correct
18 Correct 32 ms 47340 KB Output is correct
19 Correct 29 ms 47340 KB Output is correct
20 Correct 30 ms 47340 KB Output is correct
21 Correct 30 ms 47340 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47340 KB Output is correct
2 Correct 42 ms 47340 KB Output is correct
3 Correct 31 ms 47340 KB Output is correct
4 Correct 30 ms 47340 KB Output is correct
5 Correct 30 ms 47340 KB Output is correct
6 Correct 31 ms 47340 KB Output is correct
7 Correct 30 ms 47468 KB Output is correct
8 Correct 30 ms 47340 KB Output is correct
9 Correct 43 ms 47340 KB Output is correct
10 Correct 36 ms 47340 KB Output is correct
11 Correct 34 ms 47352 KB Output is correct
12 Correct 34 ms 47340 KB Output is correct
13 Correct 35 ms 47340 KB Output is correct
14 Correct 32 ms 47340 KB Output is correct
15 Correct 31 ms 47340 KB Output is correct
16 Correct 32 ms 47340 KB Output is correct
17 Correct 29 ms 47340 KB Output is correct
18 Correct 32 ms 47340 KB Output is correct
19 Correct 29 ms 47340 KB Output is correct
20 Correct 30 ms 47340 KB Output is correct
21 Correct 30 ms 47340 KB Output is correct
22 Correct 41 ms 47972 KB Output is correct
23 Correct 46 ms 47980 KB Output is correct
24 Correct 43 ms 47852 KB Output is correct
25 Correct 41 ms 47852 KB Output is correct
26 Correct 41 ms 47852 KB Output is correct
27 Correct 40 ms 47852 KB Output is correct
28 Correct 39 ms 47980 KB Output is correct
29 Correct 44 ms 48108 KB Output is correct
30 Correct 49 ms 47980 KB Output is correct
31 Correct 38 ms 47852 KB Output is correct
32 Correct 39 ms 48256 KB Output is correct
33 Correct 38 ms 48140 KB Output is correct
34 Correct 34 ms 47852 KB Output is correct
35 Correct 38 ms 47980 KB Output is correct
36 Correct 42 ms 47920 KB Output is correct
37 Correct 39 ms 47980 KB Output is correct
38 Correct 43 ms 47980 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 47340 KB Output is correct
2 Correct 42 ms 47340 KB Output is correct
3 Correct 31 ms 47340 KB Output is correct
4 Correct 30 ms 47340 KB Output is correct
5 Correct 30 ms 47340 KB Output is correct
6 Correct 31 ms 47340 KB Output is correct
7 Correct 30 ms 47468 KB Output is correct
8 Correct 30 ms 47340 KB Output is correct
9 Correct 43 ms 47340 KB Output is correct
10 Correct 36 ms 47340 KB Output is correct
11 Correct 34 ms 47352 KB Output is correct
12 Correct 34 ms 47340 KB Output is correct
13 Correct 35 ms 47340 KB Output is correct
14 Correct 32 ms 47340 KB Output is correct
15 Correct 31 ms 47340 KB Output is correct
16 Correct 32 ms 47340 KB Output is correct
17 Correct 29 ms 47340 KB Output is correct
18 Correct 32 ms 47340 KB Output is correct
19 Correct 29 ms 47340 KB Output is correct
20 Correct 30 ms 47340 KB Output is correct
21 Correct 30 ms 47340 KB Output is correct
22 Correct 41 ms 47972 KB Output is correct
23 Correct 46 ms 47980 KB Output is correct
24 Correct 43 ms 47852 KB Output is correct
25 Correct 41 ms 47852 KB Output is correct
26 Correct 41 ms 47852 KB Output is correct
27 Correct 40 ms 47852 KB Output is correct
28 Correct 39 ms 47980 KB Output is correct
29 Correct 44 ms 48108 KB Output is correct
30 Correct 49 ms 47980 KB Output is correct
31 Correct 38 ms 47852 KB Output is correct
32 Correct 39 ms 48256 KB Output is correct
33 Correct 38 ms 48140 KB Output is correct
34 Correct 34 ms 47852 KB Output is correct
35 Correct 38 ms 47980 KB Output is correct
36 Correct 42 ms 47920 KB Output is correct
37 Correct 39 ms 47980 KB Output is correct
38 Correct 43 ms 47980 KB Output is correct
39 Correct 1040 ms 68904 KB Output is correct
40 Correct 990 ms 68420 KB Output is correct
41 Correct 968 ms 68940 KB Output is correct
42 Correct 1016 ms 69248 KB Output is correct
43 Correct 1000 ms 68616 KB Output is correct
44 Correct 1042 ms 68940 KB Output is correct
45 Correct 1566 ms 76076 KB Output is correct
46 Correct 1334 ms 80868 KB Output is correct
47 Correct 610 ms 75844 KB Output is correct
48 Correct 472 ms 80596 KB Output is correct
49 Correct 929 ms 69680 KB Output is correct
50 Correct 517 ms 75916 KB Output is correct
51 Correct 924 ms 84324 KB Output is correct