oj.uz

답안 #496387

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496387 2021-12-21T06:46:45 Z NhatMinh0208 Meetings 2 (JOI21_meetings2) C++14
100 / 100
 844 ms 50144 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
set<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 dfs3(int x, int p) {
	sz[x]=1;
	for (auto g : gt[x]) if (g-p) {
		dfs3(g,x);
		sz[x]+=sz[g];
	}
}
int findCentroid(int x, int p, int n) {
	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,n);
}

void solve(int x) {
	dfs3(x,-1);
	int n = sz[x];
	int u = findCentroid(x,-1,n);
	if (n<3) return;
	int i,v,t,a,b;

		// 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 (auto g: gt[u]) {
		gt[g].erase(u);
		solve(g);
	}
	
}


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].insert(v);
		gt[v].insert(u);
	}
	solve(1);
	for (i=1;i<=n;i++) cout<<res[i]<<endl;
}
/*
		// 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;
*/

Compilation message

meetings2.cpp: In function 'void solve(int)':
meetings2.cpp:138:12: warning: unused variable 'a' [-Wunused-variable]
  138 |  int i,v,t,a,b;
      |            ^
meetings2.cpp:138:14: warning: unused variable 'b' [-Wunused-variable]
  138 |  int i,v,t,a,b;
      |              ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 7 ms 14412 KB Output is correct
3 Correct 8 ms 14412 KB Output is correct
4 Correct 7 ms 14412 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 8 ms 14308 KB Output is correct
7 Correct 8 ms 14412 KB Output is correct
8 Correct 8 ms 14356 KB Output is correct
9 Correct 7 ms 14412 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 8 ms 14348 KB Output is correct
12 Correct 8 ms 14412 KB Output is correct
13 Correct 8 ms 14412 KB Output is correct
14 Correct 8 ms 14412 KB Output is correct
15 Correct 8 ms 14412 KB Output is correct
16 Correct 9 ms 14412 KB Output is correct
17 Correct 7 ms 14412 KB Output is correct
18 Correct 8 ms 14412 KB Output is correct
19 Correct 7 ms 14412 KB Output is correct
20 Correct 9 ms 14412 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 7 ms 14412 KB Output is correct
3 Correct 8 ms 14412 KB Output is correct
4 Correct 7 ms 14412 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 8 ms 14308 KB Output is correct
7 Correct 8 ms 14412 KB Output is correct
8 Correct 8 ms 14356 KB Output is correct
9 Correct 7 ms 14412 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 8 ms 14348 KB Output is correct
12 Correct 8 ms 14412 KB Output is correct
13 Correct 8 ms 14412 KB Output is correct
14 Correct 8 ms 14412 KB Output is correct
15 Correct 8 ms 14412 KB Output is correct
16 Correct 9 ms 14412 KB Output is correct
17 Correct 7 ms 14412 KB Output is correct
18 Correct 8 ms 14412 KB Output is correct
19 Correct 7 ms 14412 KB Output is correct
20 Correct 9 ms 14412 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 14 ms 14856 KB Output is correct
23 Correct 13 ms 14796 KB Output is correct
24 Correct 13 ms 14796 KB Output is correct
25 Correct 14 ms 14844 KB Output is correct
26 Correct 12 ms 14796 KB Output is correct
27 Correct 13 ms 14840 KB Output is correct
28 Correct 12 ms 14836 KB Output is correct
29 Correct 12 ms 14796 KB Output is correct
30 Correct 12 ms 14796 KB Output is correct
31 Correct 12 ms 14796 KB Output is correct
32 Correct 14 ms 14924 KB Output is correct
33 Correct 14 ms 15052 KB Output is correct
34 Correct 11 ms 14924 KB Output is correct
35 Correct 11 ms 14972 KB Output is correct
36 Correct 12 ms 14848 KB Output is correct
37 Correct 11 ms 14924 KB Output is correct
38 Correct 12 ms 15052 KB Output is correct

Subtask #3
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14412 KB Output is correct
2 Correct 7 ms 14412 KB Output is correct
3 Correct 8 ms 14412 KB Output is correct
4 Correct 7 ms 14412 KB Output is correct
5 Correct 8 ms 14292 KB Output is correct
6 Correct 8 ms 14308 KB Output is correct
7 Correct 8 ms 14412 KB Output is correct
8 Correct 8 ms 14356 KB Output is correct
9 Correct 7 ms 14412 KB Output is correct
10 Correct 8 ms 14412 KB Output is correct
11 Correct 8 ms 14348 KB Output is correct
12 Correct 8 ms 14412 KB Output is correct
13 Correct 8 ms 14412 KB Output is correct
14 Correct 8 ms 14412 KB Output is correct
15 Correct 8 ms 14412 KB Output is correct
16 Correct 9 ms 14412 KB Output is correct
17 Correct 7 ms 14412 KB Output is correct
18 Correct 8 ms 14412 KB Output is correct
19 Correct 7 ms 14412 KB Output is correct
20 Correct 9 ms 14412 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 14 ms 14856 KB Output is correct
23 Correct 13 ms 14796 KB Output is correct
24 Correct 13 ms 14796 KB Output is correct
25 Correct 14 ms 14844 KB Output is correct
26 Correct 12 ms 14796 KB Output is correct
27 Correct 13 ms 14840 KB Output is correct
28 Correct 12 ms 14836 KB Output is correct
29 Correct 12 ms 14796 KB Output is correct
30 Correct 12 ms 14796 KB Output is correct
31 Correct 12 ms 14796 KB Output is correct
32 Correct 14 ms 14924 KB Output is correct
33 Correct 14 ms 15052 KB Output is correct
34 Correct 11 ms 14924 KB Output is correct
35 Correct 11 ms 14972 KB Output is correct
36 Correct 12 ms 14848 KB Output is correct
37 Correct 11 ms 14924 KB Output is correct
38 Correct 12 ms 15052 KB Output is correct
39 Correct 539 ms 34756 KB Output is correct
40 Correct 513 ms 34348 KB Output is correct
41 Correct 502 ms 34828 KB Output is correct
42 Correct 538 ms 35268 KB Output is correct
43 Correct 541 ms 35152 KB Output is correct
44 Correct 526 ms 35144 KB Output is correct
45 Correct 844 ms 42972 KB Output is correct
46 Correct 749 ms 47844 KB Output is correct
47 Correct 391 ms 42732 KB Output is correct
48 Correct 402 ms 46092 KB Output is correct
49 Correct 569 ms 35388 KB Output is correct
50 Correct 390 ms 36516 KB Output is correct
51 Correct 551 ms 50144 KB Output is correct