This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define double long double
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
int bm(int b, int p) {
if(p==0) return 1 % MOD;
int r = bm(b, p >> 1);
if(p&1) return (((r*r) % MOD) * b) % MOD;
return (r*r) % MOD;
}
int inv(int b) {
return bm(b, MOD-2);
}
int fastlog(int x) {
return (x == 0 ? -1 : 64 - __builtin_clzll(x) - 1);
}
void printcase(int i) { cout << "Case #" << i << ": "; }
static void run_with_stack_size(void (*func)(void), size_t stsize) {
char *stack, *send;
stack = (char *)malloc(stsize);
send = stack + stsize - 16;
send = (char *)((uintptr_t)send / 16 * 16);
asm volatile(
"mov %%rsp, (%0)\n"
"mov %0, %%rsp\n"
:
: "r"(send));
func();
asm volatile("mov (%0), %%rsp\n" : : "r"(send));
free(stack);
}
vector<int> adj[MAXN];
int ans[MAXN], n, sz[MAXN];
void dfs(int node, int prv) {
sz[node] = 1;
for(int x: adj[node]) {
if(x != prv) {
dfs(x, node);
sz[node] += sz[x];
}
}
}
int check(int node, int prv, int tar, int depth) {
int ans = 0;
if(sz[node] >= tar) ans = depth;
for(int x: adj[node]) {
if(x != prv) {
ans = max(ans, check(x, node, tar, depth + 1));
}
}
return ans;
}
void solve(int tc) {
cin >> n;
for(int i=1; i<n; i++) {
int x, y;
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
for(int i=1; i<=n; i++) {
dfs(i, -1);
for(int x: adj[i]) {
int len = n - sz[x];
int ret = check(x, i, len, 1);
ans[len * 2] = max(ans[len * 2], ret + 1);
}
}
for(int i=n-1; i>=1; i--) ans[i] = max(ans[i], ans[i+1]);
for(int i=1; i<=n; i++) {
cout << (i % 2 == 1 ? 1 : ans[i]) << "\n";
}
}
void uwu() {
ios::sync_with_stdio(0); cin.tie(0);
int t = 1; //cin >> t;
for(int i=1; i<=t; i++) solve(i);
}
int32_t main() {
#ifdef ONLINE_JUDGE
uwu();
#endif
#ifndef ONLINE_JUDGE
run_with_stack_size(uwu, 1024 * 1024 * 1024); // run with a 1 GiB stack
#endif
}
/*
g++ B.cpp -std=c++17 -O2 -o B
./B < input.txt
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |