제출 #595678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
595678		czhang2718	Meetings 2 (JOI21_meetings2)	C++17	0 / 100	3 ms	5060 KiB

meetings2

#include "bits/stdc++.h"
using namespace std;

const int N=2e5+1;
int n;
vector<int> adj[N];
int ans[N+2];
bool vis[N];
int sz[N];
int dist[N];
int add[N];
int dp[N], mx[N], mx2[N];

void dfs1(int x, vector<int> &nodes){
    vis[x]=1;
    nodes.push_back(x);
    sz[x]=1;
    for(int k:adj[x]){
        if(vis[k]) continue;
        dfs1(k, nodes);
        sz[x]+=sz[k];
    }
}

void dfs2(int x, int cnt, int &c){
    vis[x]=1;
    for(int k:adj[x]){
        if(vis[k]) continue;
        if(sz[k]>cnt/2){
            dfs2(k, cnt, c);
            if(c) return;
        }
    }
    if(!c) c=x;
}

void dfs3(int x, vector<int> &no, vector<int> &undo){
    no.push_back(x);
    vis[x]=1;
    for(int k:adj[x]){
        if(vis[k]) continue;
        dist[k]=dist[x]+1;
        dfs3(k, no, undo);
    }
    undo.push_back(sz[x]);
    // cout << "sz " << x << " " << sz[x] << "\n";
    dp[sz[x]]=max(dp[sz[x]], dist[x]);
}

void dfs4(int x){
    vis[x]=1;
    sz[x]=add[x];
    for(int k:adj[x]){
        if(vis[k]) continue;
        dfs4(k);
        sz[x]+=sz[k];
    }
}

void go(int x){
    vector<int> nodes;
    dfs1(x, nodes);
    if(nodes.size()==1) return;

    // find centroid
    for(int u:nodes) vis[u]=0;
    int c=0;
    dfs2(x, nodes.size(), c);

    // cout << "centroid " << c << "\n";
    // for(int i:nodes) cout << i << " ";
    // cout << "\n";

    // get sizes
    for(int u:nodes) vis[u]=0;
    dfs4(c);

    // combine subtrees
    for(int u:nodes) if(u!=c) vis[u]=0;
    vector<int> sizes;
    for(int k:adj[c]){
        if(vis[k]) continue;
        vector<int> nodes2;
        dist[k]=1;
        vector<int> undo;
        dfs3(k, nodes2, undo);
        for(int v:nodes2){
            ans[2*min(sz[v], sz[c]-sz[k])]=max(ans[2*min(sz[v], sz[c]-sz[k])], dist[v]);
        }
        sort(undo.begin(), undo.end());
        undo.erase(unique(undo.begin(), undo.end()), undo.end());
        for(int i:undo){
            if(dp[i]>mx[i]) mx2[i]=mx[i], mx[i]=dp[i];
            else if(dp[i]>mx2[i]) mx2[i]=dp[i];
        }

        for(int p:undo) dp[p]=-1, sizes.push_back(p);
    }
    sort(sizes.begin(), sizes.end(), greater<int>());
    sizes.erase(unique(sizes.begin(), sizes.end()), sizes.end());
    int best2=-1;
    for(int p:sizes){
        // cout << "p " << p << "\n";
        int best=mx[p];
        best2=max(best2, mx2[p]);
        if(best2!=-1){
            ans[2*p]=max(ans[2*p], best+best2);
            // cout << "ans " << 2*p << " " << best << "+" << best2 << "\n";
        }
        best2=max(best2, mx[p]);
        mx[p]=mx2[p]=-1;
    }

    for(int u:nodes) if(u!=c) vis[u]=0;
    for(int k:adj[c]){
        if(!vis[k]){
            add[k]+=sz[c]-sz[k];
            go(k);
        }
    }
}

int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    for(int i=1; i<n; i++){
        int u,v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for(int i=1; i<=n; i++) add[i]=1, mx[i]=mx2[i]=dp[i]=-1;
    go(1);

    for(int i=n-1; i>=1; i--) ans[i]=max(ans[i], ans[i+1]);
    for(int i=1; i<=n; i++){
        if(i&1) cout << "1\n";
        else cout << 1+ans[i] << "\n";
    }
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 16
• Subtask 3: 0 / 80