oj.uz

Submission #804219

# Submission time Handle Problem Language Result Execution time Memory
804219 2023-08-03T07:36:15 Z vjudge1 Meetings 2 (JOI21_meetings2) C++17
0 / 100
 10 ms 14776 KB 
#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 curK = 0, res = 0;
int f[N];
void dfs(int s, int p) {
    f[s] = -INF;
    if(sz[s] >= curK) f[s] = 0;
    int mx0 = -INF, mx1 = -INF;

    for(int to : g[s]) {
        if(to == p) continue;
        dfs(to, s);
        if(f[to] > mx0) mx1 = mx0, mx0 = f[to];
        else if(f[to] > mx1) mx1 = f[to];
        f[s] = max(f[s], f[to] + 1);
    }
    res = max(res, mx0 + mx1 + 2);
}

int func(int u, int v) {
    if(sz[u] < sz[v]) swap(u, v);
    int t1 = n - sz[v], t2 = sz[v];
    return min(t1, t2);
}

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 = 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));
    
    int root = n + 1;
    g[root].push_back(x0);
    g[root].push_back(x1);
    precalc(root, root);
    for(int i = 1; i <= 2 * 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';
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 10 ms 14776 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 10 ms 14776 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Runtime error 10 ms 14776 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -