oj.uz

답안 #971265

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971265 2024-04-28T09:22:20 Z huutuan Meetings 2 (JOI21_meetings2) C++14
0 / 100
 5 ms 27292 KB 
#include<bits/stdc++.h>

using namespace std;

const int N=2e5+10, LG=18;
int n, sz[N], ans[N], dep[N], up[LG][N], tin[N], tout[N], tdfs, par[N];
vector<int> g[N], vv[N];

void dfs(int u, int p){
   tin[u]=++tdfs;
   dep[u]=dep[p]+1;
   for (int k=1; k<LG; ++k) up[k][u]=up[k-1][up[k-1][u]];
   for (int v:g[u]) if (v!=p){
      up[0][v]=u;
      dfs(v, u);
   }
   tout[u]=tdfs;
}

int lca(int u, int v){
   if (dep[u]!=dep[v]){
      if (dep[u]<dep[v]) swap(u, v);
      int d=dep[u]-dep[v];
      for (int k=0; k<LG; ++k) if (d>>k&1) u=up[k][u];
   }
   if (u==v) return u;
   for (int k=LG-1; k>=0; --k) if (up[k][u]!=up[k][v]) u=up[k][u], v=up[k][v];
   return up[0][u];
}

int distance(int u, int v){
   return dep[u]+dep[v]-dep[lca(u, v)]*2;
}

void dfs_sz(int u, int p){
   sz[u]=1;
   par[u]=p;
   for (int v:g[u]) if (v!=p){
      dfs_sz(v, u);
      sz[u]+=sz[v];
   }
}

int find_centroid(int u, int p){
   for (int v:g[u]) if (v!=p && sz[v]*2>n) return find_centroid(v, u);
   return u;
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n;
   for (int i=1; i<n; ++i){
      int u, v; cin >> u >> v;
      g[u].push_back(v);
      g[v].push_back(u);
   }
   for (int i=1; i<=n; i+=2) ans[i]=1;
   dfs(1, 0);
   dfs_sz(1, 0);
   int cen=find_centroid(1, 0);
   dfs_sz(cen, 0);
   for (int i=1; i<=n; ++i) if (i!=cen) vv[sz[i]].push_back(i);
   set<int> st;
   pair<int, int> p={-1, -1};
   auto insert=[&](int u){
      st.insert(u);
      st.erase(par[u]);
      if ((int)st.size()==1) p={-1, -1};
      else if ((int)st.size()==2) p={*st.begin(), *st.rbegin()};
      else{
         if (p.first==par[u]) p.first=u;
         else if (p.second==par[u]) p.second=u;
         else if (distance(u, p.second)>distance(p.first, p.second)) p.first=u;
         else if (distance(u, p.first)>distance(p.first, p.second)) p.second=u;
      }
   };
   for (int i=n-(n&1); i>=2; i-=2){
      for (auto &j:vv[i/2]) insert(j);
      ans[i]=(p.first==-1)?1:distance(p.first, p.second)+1;
   }
   int mxsz=0;
   for (int u:g[cen]) mxsz=max(mxsz, sz[u]);
   for (int i=n-(n&1); i>=2; i-=2) if (mxsz>=i/2) ans[i]=max(ans[i], 2);
   for (int i=1; i<=n; ++i) cout << ans[i] << '\n';
   return 0;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 27224 KB Output is correct
2 Correct 5 ms 27228 KB Output is correct
3 Correct 4 ms 27292 KB Output is correct
4 Correct 5 ms 27228 KB Output is correct
5 Correct 5 ms 27292 KB Output is correct
6 Correct 4 ms 27228 KB Output is correct
7 Correct 5 ms 27228 KB Output is correct
8 Correct 4 ms 27228 KB Output is correct
9 Correct 5 ms 27080 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Incorrect 4 ms 27228 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 27224 KB Output is correct
2 Correct 5 ms 27228 KB Output is correct
3 Correct 4 ms 27292 KB Output is correct
4 Correct 5 ms 27228 KB Output is correct
5 Correct 5 ms 27292 KB Output is correct
6 Correct 4 ms 27228 KB Output is correct
7 Correct 5 ms 27228 KB Output is correct
8 Correct 4 ms 27228 KB Output is correct
9 Correct 5 ms 27080 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Incorrect 4 ms 27228 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 27224 KB Output is correct
2 Correct 5 ms 27228 KB Output is correct
3 Correct 4 ms 27292 KB Output is correct
4 Correct 5 ms 27228 KB Output is correct
5 Correct 5 ms 27292 KB Output is correct
6 Correct 4 ms 27228 KB Output is correct
7 Correct 5 ms 27228 KB Output is correct
8 Correct 4 ms 27228 KB Output is correct
9 Correct 5 ms 27080 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Incorrect 4 ms 27228 KB Output isn't correct
12 Halted 0 ms 0 KB -