oj.uz

Submission #997566

# Submission time Handle Problem Language Result Execution time Memory
997566 2024-06-12T14:01:54 Z hotboy2703 Meetings 2 (JOI21_meetings2) C++17
100 / 100
 450 ms 44476 KB 
#include<bits/stdc++.h>
using ll = long long;
using namespace std;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL << (i))
const ll MAXN = 2e5+100;
ll n;
vector <ll> g[MAXN];
bool del[MAXN];
ll sz[MAXN];
ll sub[MAXN];
ll in[MAXN];
ll out[MAXN];
ll max1[MAXN];
ll ans[MAXN];
ll timeDFS;
void dfs_sub(ll u,ll p){
    in[u] = ++timeDFS;
    sub[u] = 1;
    for (auto v:g[u]){
        if (v==p)continue;
        dfs_sub(v,u);
        sub[u] += sub[v];
    }
    out[u] = timeDFS;
}
void dfs_sz(ll u,ll p){
    sz[u] = 1;
    for (auto v:g[u]){
        if (del[v] || v==p)continue;
        dfs_sz(v,u);
        sz[u]+=sz[v];
    }
}
ll f(ll x,ll y){
    if (in[x] <= in[y] && in[y] <= out[x])return n-sub[y];
    else return sub[x];
}
ll find_centroid(ll u,ll p,ll root){
    for (auto v:g[u]){
        if (del[v] || v==p)continue;
        if (sz[v]*2>sz[root]){
            return find_centroid(v,u,root);
        }
    }
    return u;
}
struct node{
    ll comp,u,sz,dist;
};
vector <node> all;
void dfs(ll u,ll p,ll root1,ll root2,ll dist){
    all.push_back({root1,u,f(u,p),dist});
    for (auto v:g[u]){
        if (del[v] || v==p)continue;
        dfs(v,u,root1,root2,dist+1);
    }
}
void solve_centroid(ll u){
    dfs_sz(u,u);
    u = find_centroid(u,u,u);
    all.clear();
    for (auto v:g[u]){
        if (!del[v]){
            max1[v] = -1;
            dfs(v,u,v,u,1);
        }
    }
    sort(all.begin(),all.end(),[](node x,node y){return x.sz > y.sz;});
    ll best1 = 0,best2 = 0;
//    cout<<"CENTROID "<<u<<endl;
    for (auto x:all){
//        cout<<x.comp<<' '<<x.u<<' '<<x.sz<<' '<<x.dist<<'\n';
        if (best1 != 0 && best1 != x.comp)ans[x.sz] = max(ans[x.sz],x.dist+max1[best1]);
        else if (best2 != 0)ans[x.sz] = max(ans[x.sz],x.dist+max1[best2]);

        max1[x.comp] = max(max1[x.comp],x.dist);

        vector <ll> tmp = {best1,best2,x.comp};
        sort(tmp.begin(),tmp.end(),[](ll x,ll y){return max1[x] > max1[y];});
        tmp.resize(unique(tmp.begin(),tmp.end())-tmp.begin());
        best1 = tmp[0],best2 = tmp[1];
        ll sus = min(x.sz,f(u,x.comp));
        ans[sus] = max(ans[sus], x.dist);
    }
    del[u] = 1;
    for (auto v:g[u]){
        if (!del[v])solve_centroid(v);
    }
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);
    cin>>n;
    for (ll i = 1;i < n;i ++){
        ll u,v;
        cin>>u>>v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    for (ll i = 1;i <= n;i ++)sort(g[i].begin(),g[i].end());
    dfs_sub(1,1);
    solve_centroid(1);
    for (ll i = n;i >= 1;i --){
        ans[i] = max(ans[i],ans[i+1]);
    }
    for (ll i = 1;i <= n;i ++){
        if (i%2)cout<<1<<'\n';
        else cout<<ans[i/2]+1<<'\n';
    }
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12376 KB Output is correct
2 Correct 2 ms 14428 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 2 ms 14424 KB Output is correct
5 Correct 3 ms 14428 KB Output is correct
6 Correct 2 ms 14428 KB Output is correct
7 Correct 2 ms 14428 KB Output is correct
8 Correct 3 ms 14428 KB Output is correct
9 Correct 3 ms 14428 KB Output is correct
10 Correct 2 ms 14496 KB Output is correct
11 Correct 2 ms 14428 KB Output is correct
12 Correct 2 ms 14428 KB Output is correct
13 Correct 3 ms 14424 KB Output is correct
14 Correct 3 ms 14428 KB Output is correct
15 Correct 2 ms 14428 KB Output is correct
16 Correct 3 ms 14428 KB Output is correct
17 Correct 3 ms 14428 KB Output is correct
18 Correct 2 ms 14428 KB Output is correct
19 Correct 2 ms 14428 KB Output is correct
20 Correct 2 ms 14472 KB Output is correct
21 Correct 4 ms 14424 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12376 KB Output is correct
2 Correct 2 ms 14428 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 2 ms 14424 KB Output is correct
5 Correct 3 ms 14428 KB Output is correct
6 Correct 2 ms 14428 KB Output is correct
7 Correct 2 ms 14428 KB Output is correct
8 Correct 3 ms 14428 KB Output is correct
9 Correct 3 ms 14428 KB Output is correct
10 Correct 2 ms 14496 KB Output is correct
11 Correct 2 ms 14428 KB Output is correct
12 Correct 2 ms 14428 KB Output is correct
13 Correct 3 ms 14424 KB Output is correct
14 Correct 3 ms 14428 KB Output is correct
15 Correct 2 ms 14428 KB Output is correct
16 Correct 3 ms 14428 KB Output is correct
17 Correct 3 ms 14428 KB Output is correct
18 Correct 2 ms 14428 KB Output is correct
19 Correct 2 ms 14428 KB Output is correct
20 Correct 2 ms 14472 KB Output is correct
21 Correct 4 ms 14424 KB Output is correct
22 Correct 6 ms 14936 KB Output is correct
23 Correct 5 ms 14940 KB Output is correct
24 Correct 7 ms 14940 KB Output is correct
25 Correct 5 ms 14940 KB Output is correct
26 Correct 6 ms 15020 KB Output is correct
27 Correct 6 ms 14940 KB Output is correct
28 Correct 5 ms 14924 KB Output is correct
29 Correct 5 ms 14940 KB Output is correct
30 Correct 5 ms 14940 KB Output is correct
31 Correct 5 ms 14940 KB Output is correct
32 Correct 7 ms 15192 KB Output is correct
33 Correct 6 ms 15196 KB Output is correct
34 Correct 4 ms 14940 KB Output is correct
35 Correct 4 ms 14940 KB Output is correct
36 Correct 5 ms 15052 KB Output is correct
37 Correct 4 ms 14940 KB Output is correct
38 Correct 5 ms 15056 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12376 KB Output is correct
2 Correct 2 ms 14428 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 2 ms 14424 KB Output is correct
5 Correct 3 ms 14428 KB Output is correct
6 Correct 2 ms 14428 KB Output is correct
7 Correct 2 ms 14428 KB Output is correct
8 Correct 3 ms 14428 KB Output is correct
9 Correct 3 ms 14428 KB Output is correct
10 Correct 2 ms 14496 KB Output is correct
11 Correct 2 ms 14428 KB Output is correct
12 Correct 2 ms 14428 KB Output is correct
13 Correct 3 ms 14424 KB Output is correct
14 Correct 3 ms 14428 KB Output is correct
15 Correct 2 ms 14428 KB Output is correct
16 Correct 3 ms 14428 KB Output is correct
17 Correct 3 ms 14428 KB Output is correct
18 Correct 2 ms 14428 KB Output is correct
19 Correct 2 ms 14428 KB Output is correct
20 Correct 2 ms 14472 KB Output is correct
21 Correct 4 ms 14424 KB Output is correct
22 Correct 6 ms 14936 KB Output is correct
23 Correct 5 ms 14940 KB Output is correct
24 Correct 7 ms 14940 KB Output is correct
25 Correct 5 ms 14940 KB Output is correct
26 Correct 6 ms 15020 KB Output is correct
27 Correct 6 ms 14940 KB Output is correct
28 Correct 5 ms 14924 KB Output is correct
29 Correct 5 ms 14940 KB Output is correct
30 Correct 5 ms 14940 KB Output is correct
31 Correct 5 ms 14940 KB Output is correct
32 Correct 7 ms 15192 KB Output is correct
33 Correct 6 ms 15196 KB Output is correct
34 Correct 4 ms 14940 KB Output is correct
35 Correct 4 ms 14940 KB Output is correct
36 Correct 5 ms 15052 KB Output is correct
37 Correct 4 ms 14940 KB Output is correct
38 Correct 5 ms 15056 KB Output is correct
39 Correct 255 ms 34132 KB Output is correct
40 Correct 241 ms 34436 KB Output is correct
41 Correct 259 ms 33468 KB Output is correct
42 Correct 245 ms 34656 KB Output is correct
43 Correct 266 ms 32960 KB Output is correct
44 Correct 255 ms 34496 KB Output is correct
45 Correct 450 ms 40644 KB Output is correct
46 Correct 397 ms 44476 KB Output is correct
47 Correct 100 ms 34368 KB Output is correct
48 Correct 83 ms 33392 KB Output is correct
49 Correct 256 ms 33464 KB Output is correct
50 Correct 103 ms 33336 KB Output is correct
51 Correct 230 ms 38792 KB Output is correct