oj.uz

Submission #788375

# Submission time Handle Problem Language Result Execution time Memory
788375 2023-07-20T07:28:26 Z winter0101 Meetings 2 (JOI21_meetings2) C++14
100 / 100
 448 ms 61752 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define pil pair<int,long long>
const int maxn=2e5+9;
vector<int>a[maxn],a1[maxn],a2[maxn];
//a1 add sub
//a2 reverse sub
int sub[maxn];
int rev[maxn];
int dep[maxn];
int st[maxn][19];
int in[maxn],out[maxn];
int tme=0;
int n;
void dfs(int u,int par){
sub[u]=1;
in[u]=++tme;
for(auto v:a[u]){
    if (v==par)continue;
    dep[v]=dep[u]+1;
    st[v][0]=u;
    for1(i,1,18)st[v][i]=st[st[v][i-1]][i-1];
    dfs(v,u);
    sub[u]+=sub[v];
}
rev[u]=n+1-sub[u];
out[u]=tme;
}
int lca(int u,int v){
if (dep[u]<dep[v])swap(u,v);
int k=dep[u]-dep[v];
for1(i,0,18){
if (k>>i&1)u=st[u][i];
}
if (u==v)return u;
for2(i,18,0){
if (!st[u][i]||!st[v][i])continue;
if (st[u][i]!=st[v][i]){
    u=st[u][i];
    v=st[v][i];
}
}
return st[u][0];
}
int dis(int u,int v){
return dep[u]+dep[v]-2*dep[lca(u,v)]+1;
}
int ans[maxn];
bool t1[maxn],t2[maxn];
pii newdia(const pii &p,int u){
int x=p.fi,y=p.se,z=u;
int xy=dis(x,y),yz=dis(y,z),xz=dis(x,z);
int mx=max({xy,yz,xz});
if (mx==xy)return {x,y};
if (mx==yz)return {y,z};
if (mx==xz)return {x,z};
}
int it[maxn*4];
void update(int id,int l,int r,int u,int val){
if (l>u||r<u)return;
if (l==r){
    it[id]=val;
    return;
}
int mid=(l+r)/2;
update(id*2,l,mid,u,val);
update(id*2+1,mid+1,r,u,val);
it[id]=max(it[id*2],it[id*2+1]);
}
int get(int id,int l,int r,int u,int v){
if (l>v||r<u||u>v)return 0;
if (u<=l&&r<=v)return it[id];
int mid=(l+r)/2;
return max(get(id*2,l,mid,u,v),get(id*2+1,mid+1,r,u,v));
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("temp.INP","r",stdin);
    //freopen("temp.OUT","w",stdout);
    cin>>n;
    for1(i,1,n-1){
    int u,v;
    cin>>u>>v;
    a[u].pb(v);
    a[v].pb(u);
    }
    dfs(1,0);
    for1(i,1,n){
    a1[sub[i]].pb(i);
    a2[rev[i]].pb(i);
    }
    int cnt=0;
    pii dia;
    for2(i,n,1){
    for (auto v:a1[i]){
        t1[v]=1;
        if (t2[v]){
            cnt++;
            //ver.pb(v);
            if (cnt==1){
                dia.fi=dia.se=v;
            }
            else {
                dia=newdia(dia,v);
            }
        }
    }
    for (auto v:a2[i]){
        t2[v]=1;
        if (t1[v]){
            cnt++;
            //ver.pb(v);
            if (cnt==1){
                dia.fi=dia.se=v;
            }
            else {
                dia=newdia(dia,v);
            }
        }
    }
    if (i*2<=n){
        if (cnt>=1)ans[i*2]=dis(dia.fi,dia.se);
        else ans[i*2]=1;
    }
    }
    for1(i,1,n)t1[i]=0;
    int nwdia=0;
    for2(i,n,1){
    for (auto v:a1[i]){
        update(1,1,n,in[v],dep[v]);
        int u=v;
        for2(i1,18,0){
        if (!st[u][i1])continue;
        if (t1[st[u][i1]]){
            u=st[u][i1];
        }
        }
        if (t1[u])nwdia=max(nwdia,dep[v]-dep[u]+2);
    }
    for (auto v:a2[i+1]){
        t1[v]=1;
        int maxdep=get(1,1,n,in[v],out[v]);
        nwdia=max(nwdia,maxdep-dep[v]+2);
    }
    if (i*2<=n){
        ans[i*2]=max(ans[i*2],nwdia);
    }
    }
    for1(i,1,n){
    if (i%2==1)cout<<1<<'\n';
    else cout<<ans[i]<<'\n';
    }
}

Compilation message

meetings2.cpp: In function 'std::pair<int, int> newdia(const std::pair<int, int>&, int)':
meetings2.cpp:71:1: warning: control reaches end of non-void function [-Wreturn-type]
   71 | }
      | ^

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14416 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 7 ms 14416 KB Output is correct
11 Correct 7 ms 14416 KB Output is correct
12 Correct 7 ms 14436 KB Output is correct
13 Correct 8 ms 14464 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 7 ms 14420 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 7 ms 14420 KB Output is correct
19 Correct 7 ms 14416 KB Output is correct
20 Correct 7 ms 14448 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14416 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 7 ms 14416 KB Output is correct
11 Correct 7 ms 14416 KB Output is correct
12 Correct 7 ms 14436 KB Output is correct
13 Correct 8 ms 14464 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 7 ms 14420 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 7 ms 14420 KB Output is correct
19 Correct 7 ms 14416 KB Output is correct
20 Correct 7 ms 14448 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 10 ms 15060 KB Output is correct
23 Correct 10 ms 15060 KB Output is correct
24 Correct 11 ms 15072 KB Output is correct
25 Correct 13 ms 15116 KB Output is correct
26 Correct 11 ms 15060 KB Output is correct
27 Correct 12 ms 15068 KB Output is correct
28 Correct 10 ms 15060 KB Output is correct
29 Correct 11 ms 15076 KB Output is correct
30 Correct 10 ms 15088 KB Output is correct
31 Correct 11 ms 15004 KB Output is correct
32 Correct 12 ms 15324 KB Output is correct
33 Correct 12 ms 15316 KB Output is correct
34 Correct 11 ms 15140 KB Output is correct
35 Correct 11 ms 15056 KB Output is correct
36 Correct 11 ms 15072 KB Output is correct
37 Correct 10 ms 15060 KB Output is correct
38 Correct 10 ms 15188 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 6 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 7 ms 14416 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 7 ms 14420 KB Output is correct
10 Correct 7 ms 14416 KB Output is correct
11 Correct 7 ms 14416 KB Output is correct
12 Correct 7 ms 14436 KB Output is correct
13 Correct 8 ms 14464 KB Output is correct
14 Correct 7 ms 14420 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 7 ms 14420 KB Output is correct
17 Correct 7 ms 14420 KB Output is correct
18 Correct 7 ms 14420 KB Output is correct
19 Correct 7 ms 14416 KB Output is correct
20 Correct 7 ms 14448 KB Output is correct
21 Correct 8 ms 14420 KB Output is correct
22 Correct 10 ms 15060 KB Output is correct
23 Correct 10 ms 15060 KB Output is correct
24 Correct 11 ms 15072 KB Output is correct
25 Correct 13 ms 15116 KB Output is correct
26 Correct 11 ms 15060 KB Output is correct
27 Correct 12 ms 15068 KB Output is correct
28 Correct 10 ms 15060 KB Output is correct
29 Correct 11 ms 15076 KB Output is correct
30 Correct 10 ms 15088 KB Output is correct
31 Correct 11 ms 15004 KB Output is correct
32 Correct 12 ms 15324 KB Output is correct
33 Correct 12 ms 15316 KB Output is correct
34 Correct 11 ms 15140 KB Output is correct
35 Correct 11 ms 15056 KB Output is correct
36 Correct 11 ms 15072 KB Output is correct
37 Correct 10 ms 15060 KB Output is correct
38 Correct 10 ms 15188 KB Output is correct
39 Correct 268 ms 47260 KB Output is correct
40 Correct 261 ms 46384 KB Output is correct
41 Correct 284 ms 47472 KB Output is correct
42 Correct 287 ms 47740 KB Output is correct
43 Correct 276 ms 47784 KB Output is correct
44 Correct 280 ms 47932 KB Output is correct
45 Correct 448 ms 56512 KB Output is correct
46 Correct 439 ms 61752 KB Output is correct
47 Correct 231 ms 48080 KB Output is correct
48 Correct 198 ms 47936 KB Output is correct
49 Correct 312 ms 48600 KB Output is correct
50 Correct 209 ms 48256 KB Output is correct
51 Correct 346 ms 60552 KB Output is correct