#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 3e5 + 10;
const int INF = 1e9;
vector<int> g[N];
int n;
int sz[N];
int anc[N][20];
int tin[N], tout[N], T, depth[N];
void precalc(int s, int p) {
sz[s] = 1;
anc[s][0] = p;
tin[s] = T++;
for(int i = 1; i < 20; i++)
anc[s][i] = anc[anc[s][i - 1]][i - 1];
for(int to : g[s]) {
if(to == p) continue;
depth[to] = depth[s] + 1;
precalc(to, s);
sz[s] += sz[to];
}
tout[s] = T++;
}
bool up(int u, int v) {
return tin[u] <= tin[v] && tout[u] >= tout[v];
}
int lca(int u, int v) {
if(up(u, v)) return u;
if(up(v, u)) return v;
for(int i = 19; i >= 0; i--) {
if(!up(anc[u][i], v)) u = anc[u][i];
}
return anc[u][0];
}
int dist(int u, int v) {
return depth[u] + depth[v] - 2 * depth[lca(u, v)];
}
int root;
int curK = 0, res = 0;
int dfs(int s, int p) {
int f = -INF;
if(sz[s] >= curK) f = 0;
int mx0 = -INF, mx1 = -INF;
for(int to : g[s]) {
if(to == p) continue;
int x = dfs(to, s);
if(x >= mx0) mx1 = mx0, mx0 = x;
else if(x > mx1) mx1 = x;
f = max(f, x + 1);
}
res = max(res, mx0 + mx1 + 2 + (s != root));
return f;
}
int func(int u, int v) {
if(sz[u] < sz[v]) swap(u, v);
return min(sz[v], n - sz[v]);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin >> n;
vector<pair<int, int>> edges;
for(int i = 1; i < n; i++) {
int a, b;
cin >> a >> b;
edges.push_back({a, b});
g[a].push_back(b);
g[b].push_back(a);
}
precalc(1, 1);
int x0 = edges[0].first, x1 = edges[0].second;
for(auto [u, v] : edges) {
if(func(x0, x1) < func(u, v)) {
x0 = u;
x1 = v;
}
}
// cout << x0 << ' ' << x1 << '\n';
vector<int> rs(n + 1, 1);
int k = 2 * func(x0, x1);
// g[x0].erase(find(g[x0].begin(), g[x0].end(), x1));
// g[x1].erase(find(g[x1].begin(), g[x1].end(), x0));
root = n + 1;
g[root].push_back(x0);
g[root].push_back(x1);
precalc(root, root);
for(int i = 1; i <= k; i++) {
if(i % 2) continue;
res = 0, curK = i / 2;
dfs(root, root);
rs[i] = res;
}
for(int i = 1; i <= n; i++)
cout << rs[i] << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
10 ms |
14688 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
10 ms |
14688 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
10 ms |
14688 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
