oj.uz

Submission #952330

# Submission time Handle Problem Language Result Execution time Memory
952330 2024-03-23T14:27:30 Z GrindMachine Meetings 2 (JOI21_meetings2) C++17
100 / 100
 470 ms 50500 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi

*/

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[N];

struct lca_algo {
    // LCA template (for graphs with 1-based indexing)
 
    int LOG = 1;
    vector<int> depth;
    vector<vector<int>> up;
    vector<int> tin, tout;
    int timer = 1;
 
    lca_algo() {
 
    }
 
    lca_algo(int n) {
        lca_init(n);
    }
 
    void lca_init(int n) {
        while ((1 << LOG) < n) LOG++;
        up = vector<vector<int>>(n + 1, vector<int>(LOG, 1));
        depth = vector<int>(n + 1);
        tin = vector<int>(n + 1);
        tout = vector<int>(n + 1);
 
        lca_dfs(1, -1);
    }
 
    void lca_dfs(int node, int par) {
        tin[node] = timer++;
 
        trav(child, adj[node]) {
            if (child == par) conts;
 
            up[child][0] = node;
            rep1(j, LOG - 1) {
                up[child][j] = up[up[child][j - 1]][j - 1];
            }
 
            depth[child] = depth[node] + 1;
 
            lca_dfs(child, node);
        }
 
        tout[node] = timer-1;
    }
 
    int lift(int u, int k) {
        rep(j, LOG) {
            if (k & (1 << j)) {
                u = up[u][j];
            }
        }
 
        return u;
    }

    int query(int u, int v) {
        if (depth[u] < depth[v]) swap(u, v);
        int k = depth[u] - depth[v];
        u = lift(u, k);
 
        if (u == v) return u;
 
        rev(j, LOG - 1, 0) {
            if (up[u][j] != up[v][j]) {
                u = up[u][j];
                v = up[v][j];
            }
        }
 
        u = up[u][0];
        return u;
    }
 
    int get_dis(int u, int v) {
        int lca = query(u, v);
        return depth[u] + depth[v] - 2 * depth[lca];
    }
 
    bool is_ances(int u, int v){
        return tin[u] <= tin[v] and tout[u] >= tout[v];
    }
};

vector<ll> subsiz(N), depth(N);

void dfs1(ll u, ll p){
    subsiz[u] = 1;
    trav(v,adj[u]){
        if(v == p) conts;
        depth[v] = depth[u]+1;
        dfs1(v,u);
        subsiz[u] += subsiz[v];
    }
}

ll dfs2(ll u, ll p){
    trav(v,adj[u]){
        if(v == p) conts;
        if(subsiz[v] > subsiz[1]/2){
            return dfs2(v,u);
        }
    }
  
    return u;
}

void solve(int test_case)
{
    ll n; cin >> n;
    rep1(i,n-1){
        ll u,v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }

    dfs1(1,-1);
    ll r = dfs2(1,-1);    
    dfs1(r,-1);

    lca_algo LCA(n);

    vector<pll> order;
    rep1(i,n) order.pb({subsiz[i],i});
    sort(rall(order));
    vector<ll> ans(n+5);
    array<ll,3> diam = {0,r,r};

    for(auto [siz,u] : order){
        auto nxt_diam = diam;
        rep1(j,2){
            ll v = diam[j];
            array<ll,3> ar = {LCA.get_dis(u,v),u,v};
            amax(nxt_diam,ar);
        }

        diam = nxt_diam;

        rep1(j,2){
            ll v = diam[j];
            ll d = LCA.get_dis(u,v);
            amax(ans[siz],d);
        }
    }

    rev(i,n,1) amax(ans[i],ans[i+1]);

    rep1(i,n){
        if(i&1) cout << 1 << endl;
        else cout << ans[i/2]+1 << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 3 ms 8280 KB Output is correct
4 Correct 3 ms 8280 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 3 ms 8304 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 3 ms 8284 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 2 ms 8284 KB Output is correct
14 Correct 3 ms 8184 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 3 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 3 ms 8284 KB Output is correct
20 Correct 3 ms 8300 KB Output is correct
21 Correct 2 ms 8284 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 3 ms 8280 KB Output is correct
4 Correct 3 ms 8280 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 3 ms 8304 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 3 ms 8284 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 2 ms 8284 KB Output is correct
14 Correct 3 ms 8184 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 3 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 3 ms 8284 KB Output is correct
20 Correct 3 ms 8300 KB Output is correct
21 Correct 2 ms 8284 KB Output is correct
22 Correct 5 ms 8876 KB Output is correct
23 Correct 7 ms 8796 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 6 ms 8796 KB Output is correct
26 Correct 6 ms 8796 KB Output is correct
27 Correct 6 ms 8996 KB Output is correct
28 Correct 5 ms 8796 KB Output is correct
29 Correct 5 ms 8920 KB Output is correct
30 Correct 6 ms 8824 KB Output is correct
31 Correct 5 ms 9048 KB Output is correct
32 Correct 6 ms 9052 KB Output is correct
33 Correct 5 ms 8908 KB Output is correct
34 Correct 6 ms 8796 KB Output is correct
35 Correct 5 ms 8796 KB Output is correct
36 Correct 5 ms 8796 KB Output is correct
37 Correct 6 ms 8928 KB Output is correct
38 Correct 5 ms 9304 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 3 ms 8280 KB Output is correct
4 Correct 3 ms 8280 KB Output is correct
5 Correct 2 ms 8284 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 2 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 3 ms 8304 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 3 ms 8284 KB Output is correct
12 Correct 3 ms 8284 KB Output is correct
13 Correct 2 ms 8284 KB Output is correct
14 Correct 3 ms 8184 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 3 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 3 ms 8284 KB Output is correct
19 Correct 3 ms 8284 KB Output is correct
20 Correct 3 ms 8300 KB Output is correct
21 Correct 2 ms 8284 KB Output is correct
22 Correct 5 ms 8876 KB Output is correct
23 Correct 7 ms 8796 KB Output is correct
24 Correct 6 ms 8796 KB Output is correct
25 Correct 6 ms 8796 KB Output is correct
26 Correct 6 ms 8796 KB Output is correct
27 Correct 6 ms 8996 KB Output is correct
28 Correct 5 ms 8796 KB Output is correct
29 Correct 5 ms 8920 KB Output is correct
30 Correct 6 ms 8824 KB Output is correct
31 Correct 5 ms 9048 KB Output is correct
32 Correct 6 ms 9052 KB Output is correct
33 Correct 5 ms 8908 KB Output is correct
34 Correct 6 ms 8796 KB Output is correct
35 Correct 5 ms 8796 KB Output is correct
36 Correct 5 ms 8796 KB Output is correct
37 Correct 6 ms 8928 KB Output is correct
38 Correct 5 ms 9304 KB Output is correct
39 Correct 290 ms 45856 KB Output is correct
40 Correct 252 ms 44460 KB Output is correct
41 Correct 293 ms 45972 KB Output is correct
42 Correct 282 ms 45976 KB Output is correct
43 Correct 315 ms 46668 KB Output is correct
44 Correct 282 ms 46000 KB Output is correct
45 Correct 470 ms 48812 KB Output is correct
46 Correct 371 ms 50360 KB Output is correct
47 Correct 207 ms 46612 KB Output is correct
48 Correct 184 ms 46564 KB Output is correct
49 Correct 312 ms 46264 KB Output is correct
50 Correct 186 ms 47164 KB Output is correct
51 Correct 313 ms 50500 KB Output is correct