Submission #68575629

---

Source Code Expand

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N,M;cin>>N>>M;
  vvl E(N);
  dsu G(N);
  vector<pl>es;
  rep(i,0,M){
    ll u,v;cin>>u>>v;u--;v--;
    if(G.same(u,v)){
      es.emplace_back(pl(u,v));
    }
    else{
      E[u].emplace_back(v);
      E[v].emplace_back(u);
      G.merge(u,v);
    }
  }
  vl P(N),D(N),tour,idx(N),out(N);
  function<void(ll)>dfs=[&](ll v){
    tour.emplace_back(v);
    idx[v]=sz(tour)-1;
    for(auto u:E[v])if(u!=P[v]){
      P[u]=v;
      D[u]=D[v]+1;
      dfs(u);
    }
    out[v]=sz(tour);
  };
  dfs(0);
  vvl dou(20,vl(N));
  dou[0]=P;
  rep(i,1,20)rep(j,0,N)dou[i][j]=dou[i-1][dou[i-1][j]];
  auto up=[&](ll v,ll d){
    rep(i,0,20)if((d>>i)%2)v=dou[i][v];
    return v;
  };
  auto lca=[&](ll u,ll v){
    if(D[u]>D[v])swap(u,v);
    v=up(v,D[v]-D[u]);
    rrep(i,0,20)if(dou[i][u]!=dou[i][v])u=dou[i][u],v=dou[i][v];
    if(u==v)return u;
    return P[u];
  };
  ll L=sz(es);
  vl V(2*L);
  rep(i,0,L)V[2*i]=es[i].F,V[2*i+1]=es[i].S;
  V.emplace_back(0);
  V.emplace_back(N-1);
  vvl LCA(2*L+2,vl(2*L+2));
  rep(i,0,2*L+2)rep(j,0,2*L+2)LCA[i][j]=lca(V[i],V[j]);
  
  vl ans(N),rev(N);
  fenwick_tree<ll>F(N);
  vl nec(2*L+2);
  rep(i,0,1<<L){
    vl X={2*L,2*L+1};
    rep(j,0,L)if((i>>j)%2)X.emplace_back(2*j),X.emplace_back(2*j+1);
    sort(all(X),[&](ll u,ll v){return idx[V[u]]<idx[V[v]];});
    for(auto x:X)F.add(idx[V[x]],1);
    stack<ll>st;
    ll l=sz(X)/2-1;
    rep(i,0,sz(X)){
      st.emplace(X[i]);
      while(sz(st)>1){
        ll v=st.top();st.pop();
        ll u=st.top();
        ll t=LCA[u][v];
        if(F.sum(idx[t],out[t])==2){
          l+=D[V[u]]+D[V[v]]-2*D[t];
          F.add(idx[V[u]],-1);
          F.add(idx[V[v]],-1);
          nec[u]=v;
          nec[v]=u;
          st.pop();
        }
        else{
          st.emplace(v);
          break;
        }
      }
    }
    if(!sz(st)){
      ll v=2*L,cnt=0;
      do{
        v=nec[v];
        cnt++;
        v^=1;
      }while(v!=2*L);
      if(cnt==sz(X)/2)ans[l]++;
    }
    while(sz(st)){
      ll v=st.top();st.pop();
      F.add(idx[V[v]],-1);
    }
  }
  ans.erase(ans.begin());
  cout<<ans<<endl;
  return 0;
}

Submission Info

Judge Result