最近公共祖先LCA(模板)

最近公共祖先LCA(模板)

效率比较

树链求LCA

const int N=5e5+5;
const int M=1e6+5;

struct LS{
    int cnt=0;
    struct cpp {
        int to,cost,next;
    }edge[N*2];
    int head[ N ];
    void inta(){
        cnt=0;
        memset( head,-1,sizeof(head) );
    }
    void addEdge(int from,int to,int cost){
        ++cnt;
        edge[cnt].to = to;
        edge[cnt].cost = cost;
        edge[cnt].next = head[from];
        head[from] =cnt;
    }
}G;

int n,m,root;
struct T{
    int fa,dep,size,son,top;
}node[N];

void dfs1(int u,int f,int depth){
    node[u].fa = f ;
    node[u].dep = depth ;
    node[u].size = 1 ;
    for(int i=G.head[u];i!=-1;i=G.edge[i].next){
        int v=G.edge[i].to;
        if(v==f) continue;
        dfs1(v,u,depth+1);
        node[u].size += node[v].size;
        if( node[v].size > node[node[u].son].size ) node[u].son = v;
    }
}

void dfs2(int u,int t){
    node[u].top = t ;
    if( !node[u].son ) return;
    dfs2( node[u].son,t );
    for(int i=G.head[u];i!=-1;i=G.edge[i].next){
        int v=G.edge[i].to;
        if( v!=node[u].son && v!=node[u].fa )
        dfs2(v,v);
    }
}

int lca_query(int x,int y){
    while( node[x].top!=node[y].top ){
        if( node[ node[x].top ].dep < node[ node[y].top ].dep ){
            swap(x,y);
        }
        x = node[ node[ x ].top ].fa ;
    }
    return node[x].dep<node[y].dep?x:y;
}

int main(){
    cin>>n>>m>>root;
    G.inta();
    int u,v;
    for(int i=1;i<=n-1;++i){
        cin>>u>>v;
        G.addEdge(u,v,0);
        G.addEdge(v,u,0);
    }
    dfs1(root,-1,1);
    dfs2(root,root);
    for(int i=1;i<=m;++i){
        cin>>u>>v;
        printf("%d\n",lca_query( u,v ));
    }
    return 0;
}

倍增求LCA

const int N=6e5+5;
const int M=6e5+5;

int n,m,s;
int depth[N];
int anc[N][30];

int cnt=0;
struct cpp {
    int to,cost,next;
}edge[N*2];//边数
int head[ N*2 ];//点数
void inta(){//初始化
    cnt=0; memset( head,-1,sizeof(head) );
}
void addEdge(int from,int to,int cost){
    cnt++;
    edge[cnt].to = to;
    edge[cnt].cost = cost;
    edge[cnt].next = head[from];
    head[from] =cnt;
}

void dfs(int u,int fa){//深搜出各点的深度 , 存在depth中
    anc[u][0]=fa;
    for(int i=head[u];i!=-1;i=edge[i].next){//遍历
        if( edge[i].to==fa ) continue;
        depth[edge[i].to] = depth[u] + 1 ;
        dfs(edge[i].to,u);
    }
}

void bz(){//倍增,处理father数组
    int maxdep=int(log(n)/log(2));

    for(int j=1;j<=maxdep;j++){
        for(int i=1;i<=n;i++){//i = 点下标
            anc[i][j] = anc[ anc[i][j-1] ][j-1];//初始化全部赋值-1
        }
    }
}
int lca_query(int u,int v){
    if( depth[u]<depth[v] ) swap(u,v);

    int logsn = int( log(depth[u])/log(2) );
    for(int i = logsn;i>=0;i--){
        if( depth[u] - (1<<i)>=depth[v] )
            u = anc[u][i];
    }
    if(u==v) return u;
    for(int i=logsn;i>=0;i--){
        if( anc[u][i]!=-1 && anc[u][i]!=anc[v][i] ){
            u = anc[u][i];
            v = anc[v][i];
        }
    }
    return anc[u][0];
}
void init(){
    memset(anc,-1,sizeof(anc));
    dfs(s,-1);
    bz();
}

int main(){
    inta();
    cin>>n>>m>>s;
    int u,v;
    for(int i=1;i<=n-1;++i){
        cin>>u>>v;
        addEdge(u,v,1);
        addEdge(v,u,1);
    }
    init();
    while(m--){
        cin>>u>>v;
        printf("%d\n",lca_query(u,v));
    }
    return 0;
}

Tarjan求LCA

const int N=5e5+5;
const int M=1e6+5;

int fa[N];
inline int find(int u){
    if ( 0==fa[u]) return fa[u]=u;
    int x=u,t;
    while(x!=fa[x]) x=fa[x];
    while(u!=x){ t=fa[u];fa[u]=x;u=t; }
    return x;
}

int n,m,s;

struct E{
    int cnt=0;
    struct cpp {
        int to,cost,next;
    }edge[N*2];
    int head[ N ];
    void inta(){
        cnt=0;
        memset( head,-1,sizeof(head) );
    }
    void addEdge(int from,int to,int cost){
        ++cnt;
        edge[cnt].to = to;
        edge[cnt].cost = cost;
        edge[cnt].next = head[from];
        head[from] =cnt;
    }
}B,G;

map< pair<int , int> ,int> fx;
int uu[N],vv[N],uv_lca[N];

bool vis[N];
void Tarjan_Lca(int u){
    vis[u] = 1;
    for(int i=B.head[u] ; i!=-1 ;i=B.edge[i].next){
        int v = B.edge[i].to;
        if(vis[v]) continue;
        Tarjan_Lca(v);
        fa[v] = u;
    }
    for(int i=G.head[u] ; i!=-1 ;i=G.edge[i].next){
        int v = G.edge[i].to;
        if( vis[v] ){
            fx[make_pair(min(u,v),max(u,v))]=find(v);
        }
    }
}

int main(){
    cin>>n>>m>>s;
    rep(i,1,n) fa[i]=i;
    B.inta();
    int u,v;
    for(int i=1;i<=n-1;++i){
        cin>>u>>v;
        B.addEdge(u,v,0);
        B.addEdge(v,u,0);
    }
    G.inta();
    for(int i=1;i<=m;++i){
        cin>>uu[i]>>vv[i];
        G.addEdge(uu[i],vv[i],0);
        G.addEdge(vv[i],uu[i],0);
    }
    Tarjan_Lca(s);
    for(int i=1;i<=m;++i){
        printf("%d\n",fx[make_pair( min(uu[i],vv[i]),max(uu[i],vv[i]) )]);
    }
    return 0;
}

模板题:洛谷LCA模板题