oj.uz

Submission #496240

# Submission time Handle Problem Language Result Execution time Memory
496240 2021-12-21T03:47:17 Z NhatMinh0208 Meetings 2 (JOI21_meetings2) C++14
20 / 100
 4000 ms 17784 KB 
#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 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<pii(int)> upd[200001];
vector<int> szVec;
int sz[200001];
int par[200001];
int mxSz[200001];
int res[200001];
int n,m,i,j,k,t,t1,u,v,a,b;
int c1,c2;
multiset<pii(int)> lmao;
pii(int) p1,p2;

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]);
}

void dfs1(int x, int p, int d) {
	sz[x]=d;
	par[x]=p;
	for (auto g : gt[x]) if (g-p) {
		dfs1(g,x,d+1);
	}
}

int main()
{
	fio;
	cin>>n;
	if (n==1) {
		cout<<1;
		return 0;
	}
	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);
	}
	
	for (u=1;u<=n;u++) if (gt[u].size()>1) {
		// cout<<u<<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,g});
			for (i=t;i>=1;i--) upd[mxSz[i]+1].push_back({i,g});
			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.fi,g.se}));
				lmao.insert({g.fi-1,g.se});
			}
			// for (auto g : lmao) cout<<'('<<g.fi<<' '<<g.se<<") "; cout<<endl;
			v=0;
			auto it = lmao.end();
			it--; p1=(*it);
			it--; p2=(*it);
			if (p1.fi && p2.fi) {
				v=p1.fi+p2.fi;
			}
			else {
				if (n-sz[p1.se]<i) v=0;
				else v=p1.fi;
			}
			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;
}
/*

	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;
*/

Subtask #1
4.0 / 4.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 6 ms 9728 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 5 ms 9676 KB Output is correct
14 Correct 5 ms 9676 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct
16 Correct 5 ms 9676 KB Output is correct
17 Correct 7 ms 9700 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 6 ms 9672 KB Output is correct
20 Correct 7 ms 9728 KB Output is correct
21 Correct 6 ms 9708 KB Output is correct
22 Correct 206 ms 9888 KB Output is correct
23 Correct 203 ms 9868 KB Output is correct
24 Correct 197 ms 9876 KB Output is correct
25 Correct 193 ms 10016 KB Output is correct
26 Correct 205 ms 9804 KB Output is correct
27 Correct 191 ms 9888 KB Output is correct
28 Correct 202 ms 9872 KB Output is correct
29 Correct 196 ms 9892 KB Output is correct
30 Correct 200 ms 9880 KB Output is correct
31 Correct 196 ms 9968 KB Output is correct
32 Correct 522 ms 10188 KB Output is correct
33 Correct 886 ms 10316 KB Output is correct
34 Correct 135 ms 9932 KB Output is correct
35 Correct 8 ms 10188 KB Output is correct
36 Correct 187 ms 9916 KB Output is correct
37 Correct 12 ms 9932 KB Output is correct
38 Correct 285 ms 10208 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9676 KB Output is correct
5 Correct 5 ms 9676 KB Output is correct
6 Correct 6 ms 9676 KB Output is correct
7 Correct 6 ms 9728 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 5 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 5 ms 9676 KB Output is correct
13 Correct 5 ms 9676 KB Output is correct
14 Correct 5 ms 9676 KB Output is correct
15 Correct 5 ms 9676 KB Output is correct
16 Correct 5 ms 9676 KB Output is correct
17 Correct 7 ms 9700 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 6 ms 9672 KB Output is correct
20 Correct 7 ms 9728 KB Output is correct
21 Correct 6 ms 9708 KB Output is correct
22 Correct 206 ms 9888 KB Output is correct
23 Correct 203 ms 9868 KB Output is correct
24 Correct 197 ms 9876 KB Output is correct
25 Correct 193 ms 10016 KB Output is correct
26 Correct 205 ms 9804 KB Output is correct
27 Correct 191 ms 9888 KB Output is correct
28 Correct 202 ms 9872 KB Output is correct
29 Correct 196 ms 9892 KB Output is correct
30 Correct 200 ms 9880 KB Output is correct
31 Correct 196 ms 9968 KB Output is correct
32 Correct 522 ms 10188 KB Output is correct
33 Correct 886 ms 10316 KB Output is correct
34 Correct 135 ms 9932 KB Output is correct
35 Correct 8 ms 10188 KB Output is correct
36 Correct 187 ms 9916 KB Output is correct
37 Correct 12 ms 9932 KB Output is correct
38 Correct 285 ms 10208 KB Output is correct
39 Execution timed out 4067 ms 17784 KB Time limit exceeded
40 Halted 0 ms 0 KB -