Submission #496201

#	Time	Username	Problem	Language	Result	Execution time	Memory
496201		NhatMinh0208	Meetings 2 (JOI21_meetings2)	C++14	0 / 100	6 ms	9680 KiB

meetings2

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
vector<int> gt[200001];
vector<int> upd[200001];
vector<int> szVec;
int sz[200001];
int mxSz[200001];
int res[200001];
int n,m,i,j,k,t,t1,u,v,a,b;
multiset<int> lmao;
void dfs1(int x, int p) {
	sz[x]=1;
	for (auto g : gt[x]) if (g-p) {
		dfs1(g,x);
		sz[x]+=sz[g];
	}
}
int findCentroid(int x, int p) {
	int u=-1;
	for (auto g : gt[x]) if (g-p) {
		if (u==-1) u=g;
		else if (sz[g]>sz[u]) u=g;
	}
	if (sz[u] * 2 <= n && sz[x] * 2 >=n) return x;
	else return findCentroid(u,x);
}
void dfs2(int x, int p, int d) {
	sz[x]=1;
	for (auto g : gt[x]) if (g-p) {
		dfs2(g,x,d+1);
		sz[x]+=sz[g];
	}
	mxSz[d]=max(mxSz[d],sz[x]);
}

int main()
{
	fio;
	cin>>n;
	if (n==2) {
		cout<<1<<endl<<2;
		return 0;
	}
	for (i=1;i<n;i++) {
		cin>>u>>v;
		gt[u].push_back(v);
		gt[v].push_back(u);
	}
	dfs1(1,-1);
	u=findCentroid(1,-1);
	for (auto g : gt[u]) {
		szVec.clear();
		dfs2(g,u,1);
		for (t=1;t<=n;t++) if (mxSz[t]==0) break;
		t--;
		lmao.insert(t);
		for (i=t;i>=1;i--) upd[mxSz[i]+1].push_back(i);
		for (i=1;i<=t;i++) mxSz[i]=0;
	}
	for (i=1;i*2<=n;i++) {
		for (auto g : upd[i]) {
			lmao.erase(lmao.lower_bound(g));
			lmao.insert(g-1);
		}
		// for (auto g : lmao) cout<<g<<' '; cout<<endl;
		v=0;
		auto it = lmao.end();
		it--; v+=(*it);
		it--; v+=(*it);
		res[i*2-1]=1;
		res[i*2]=max(res[i*2],v+1);
	}
	if (n%2) res[n]=1;

	for (auto g : gt[u]) if (sz[g]*2==n) {
		// cout<<g<<' '<<sz[g]<<endl;
		u=g; break;
	}
	// cout<<endl;
	// cout<<u<<endl;
	// cout<<endl;
	for (i=1;i<=n;i++) upd[i].clear();
	lmao.clear();
	for (auto g : gt[u]) {
		szVec.clear();
		dfs2(g,u,1);
		for (t=1;t<=n;t++) if (mxSz[t]==0) break;
		t--;
		lmao.insert(t);
		for (i=t;i>=1;i--) upd[mxSz[i]+1].push_back(i);
		for (i=1;i<=t;i++) mxSz[i]=0;
	}
	for (i=1;i*2<=n;i++) {
		for (auto g : upd[i]) {
			lmao.erase(lmao.lower_bound(g));
			lmao.insert(g-1);
		}
		// for (auto g : lmao) cout<<g<<' '; cout<<endl;
		v=0;
		auto it = lmao.end();
		it--; v+=(*it);
		it--; v+=(*it);
		res[i*2-1]=1;
		res[i*2]=max(res[i*2],v+1);
	}
	if (n%2) res[n]=1;

	for (i=1;i<=n;i++) cout<<res[i]<<endl;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 16
• Subtask 3: 0 / 80