#include "graph_tree/lca_short.hpp"
#pragma once #include<vector> #include"graph_template.hpp" /** * @brief LCA(HL分解)&lt;O(N),O(logN)&gt; */ struct lca{ graph g; std::vector<int>sz,in,out,nxt,par,par2; lca(const graph& g,int s):g(g){ int n=g.size(); sz.resize(n,0); in.resize(n,0); out.resize(n,0); nxt.resize(n,s); par.resize(n,s); par2.resize(n,s); dfs_sz(s,-1); dfs_hld(s,-1); } void dfs_sz(int v,int p) { sz[v] = 1; for(auto &u: g[v]) { if(p==u)continue; dfs_sz(u,v); sz[v]+=sz[u]; if(sz[u]>sz[g[v][0]])std::swap(u,g[v][0]); } } void dfs_hld(int v,int p) { static int t=0; in[v]=t++; for(auto u: g[v]){ if(p==u)continue; nxt[u]=(u==g[v][0]?nxt[v]:u); par[u]=(u==g[v][0]?par[v]:v); par2[u]=v; dfs_hld(u,v); } out[v] = t; } int query(int s,int t){ while(nxt[s]!=nxt[t]){ if(sz[nxt[s]]>sz[nxt[t]])t=par[t]; else s=par[s]; } return sz[s]>sz[t]?s:t; } int distance(int s,int t){ int res=0; while(nxt[s]!=nxt[t]){ if(sz[nxt[s]]>sz[nxt[t]]){ res+=in[t]-in[nxt[t]]+1; t=par[t]; } else { res+=in[s]-in[nxt[s]]+1; s=par[s]; } } return res+std::abs(in[s]-in[t]); } std::vector<int>path(int s,int t){ int l=query(s,t); std::vector<int>p,q; while(s!=l){ p.push_back(s); s=par2[s]; } while(t!=l){ q.push_back(t); t=par2[t]; } p.push_back(l); p.insert(p.end(),q.rbegin(),q.rend()); return p; } };
#line 2 "graph_tree/lca_short.hpp" #include<vector> #line 3 "graph_tree/graph_template.hpp" #include<tuple> #include<iostream> /** * @brief グラフテンプレート */ using graph=std::vector<std::vector<int>>; template<typename T> using graph_w=std::vector<std::vector<std::pair<int,T>>>; graph load_graph(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);g[t].push_back(s);}return g;} graph load_digraph(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);}return g;} graph load_graph0(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);g[t].push_back(s);}return g;} graph load_digraph0(int n,int m){graph g(n);for(int i=0;i<m;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);}return g;} graph load_tree(int n){graph g(n);for(int i=0;i<n-1;++i){int s,t;std::cin>>s>>t;--s;--t;g[s].push_back(t);g[t].push_back(s);}return g;} graph load_tree0(int n){graph g(n);for(int i=0;i<n-1;++i){int s,t;std::cin>>s>>t;g[s].push_back(t);g[t].push_back(s);}return g;} graph load_treep(int n){graph g(n);for(int i=0;i<n-1;++i){int t;std::cin>>t;g[i+1].push_back(t);g[t].push_back(i+1);}return g;} template<typename T>graph_w<T> load_graph_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;} template<typename T>graph_w<T> load_digraph_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);}return g;} template<typename T>graph_w<T> load_graph0_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;} template<typename T>graph_w<T> load_digraph0_weight(int n,int m){graph_w<T> g(n);for(int i=0;i<m;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);}return g;} template<typename T>graph_w<T> load_tree_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int s,t;T u;std::cin>>s>>t>>u;--s;--t;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;} template<typename T>graph_w<T> load_tree0_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int s,t;T u;std::cin>>s>>t>>u;g[s].emplace_back(t,u);g[t].emplace_back(s,u);}return g;} template<typename T>graph_w<T> load_treep_weight(int n){graph_w<T> g(n);for(int i=0;i<n-1;++i){int t;T u;std::cin>>t>>u;g[i+1].emplace_back(t,u);g[t].emplace_back(i+1,u);}return g;} #line 4 "graph_tree/lca_short.hpp" /** * @brief LCA(HL分解)&lt;O(N),O(logN)&gt; */ struct lca{ graph g; std::vector<int>sz,in,out,nxt,par,par2; lca(const graph& g,int s):g(g){ int n=g.size(); sz.resize(n,0); in.resize(n,0); out.resize(n,0); nxt.resize(n,s); par.resize(n,s); par2.resize(n,s); dfs_sz(s,-1); dfs_hld(s,-1); } void dfs_sz(int v,int p) { sz[v] = 1; for(auto &u: g[v]) { if(p==u)continue; dfs_sz(u,v); sz[v]+=sz[u]; if(sz[u]>sz[g[v][0]])std::swap(u,g[v][0]); } } void dfs_hld(int v,int p) { static int t=0; in[v]=t++; for(auto u: g[v]){ if(p==u)continue; nxt[u]=(u==g[v][0]?nxt[v]:u); par[u]=(u==g[v][0]?par[v]:v); par2[u]=v; dfs_hld(u,v); } out[v] = t; } int query(int s,int t){ while(nxt[s]!=nxt[t]){ if(sz[nxt[s]]>sz[nxt[t]])t=par[t]; else s=par[s]; } return sz[s]>sz[t]?s:t; } int distance(int s,int t){ int res=0; while(nxt[s]!=nxt[t]){ if(sz[nxt[s]]>sz[nxt[t]]){ res+=in[t]-in[nxt[t]]+1; t=par[t]; } else { res+=in[s]-in[nxt[s]]+1; s=par[s]; } } return res+std::abs(in[s]-in[t]); } std::vector<int>path(int s,int t){ int l=query(s,t); std::vector<int>p,q; while(s!=l){ p.push_back(s); s=par2[s]; } while(t!=l){ q.push_back(t); t=par2[t]; } p.push_back(l); p.insert(p.end(),q.rbegin(),q.rend()); return p; } };