【图论】tarjan求LCA(链式前向星)

前向星的写法：

#include<bits/stdc++.h>
#define ll int
#define endl '\n'
#define IO ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int maxn=5e5+5;
bool vis[maxn];int head[maxn],hea[maxn];int fa[maxn];
int n,m,s;
int tot,cnt;
struct E{
	int to,next;
}edge[maxn<<1];

struct E2{
	int to,next,lca;
}edge2[maxn<<1];

inline void add(int u,int v){
	edge[tot].to=v;
	edge[tot].next=head[u];
	head[u]=tot++;
}

inline void add2(int u,int v){
	edge2[cnt].to=v;
	edge2[cnt].next=hea[u];
	hea[u]=cnt++;
}

int find(int x){
	while(fa[x]!=x) x=fa[x]=fa[fa[x]];
	return x;
}
void tarjan(int x){
	vis[x]=1;
	for(int i=head[x];i;i=edge[i].next){
		int v=edge[i].to;
		if(vis[v]) continue;
		tarjan(v);
		fa[find(v)]=find(x);
	}
	for(int i=hea[x];i;i=edge2[i].next){
		int v=edge2[i].to;
		if(vis[v]) edge2[i].lca=find(v);
	}
}

int main(){
	scanf("%d%d%d",&n,&m,&s);
	tot=1,cnt=1;
	for(int i=1;i<=n;i++) fa[i]=i;
	for(int i=1;i<n;i++){
		int x,y;scanf("%d%d",&x,&y);
		add(x,y);add(y,x);
	}
	for(int i=1;i<=m;i++){
		int x,y;scanf("%d%d",&x,&y);
		add2(x,y);add2(y,x);
	}	
	tarjan(s);
    for(int i=1;i<cnt;i+=2)
        printf("%d\n",edge2[i].lca==0?edge2[i+1].lca:edge2[i].lca);	
}

vector写法，但是vector执行效率低，面对1e5这样大数据的时候就不行会爆TLE

```cpp
#include<bits/stdc++.h>
#define ll int
#define endl '\n'
#define IO ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int maxn=5e5+5;
bool vis[maxn];
ll depth[maxn];
ll n,m,s;
vector<ll> vec[maxn];
vector<ll> Q[maxn];
ll fa[maxn];
struct query{
	ll x,y,lca;
}query[maxn];
ll find(ll x){
	while(x!=fa[x]) x=fa[x]=fa[fa[x]];
	return x;
}
void merge(ll v,ll u){
	ll vfa=find(v),ufa=find(u);
	if(vfa==ufa) return ;
	else fa[v]=u;
}
void tarjan(ll u){
	vis[u]=1;
	for(ll i=0;i<vec[u].size();i++){
		ll v=vec[u][i];
		if(vis[v]) continue;
		depth[v]=depth[u]+1;
		tarjan(v);
		merge(v,u);
	}	
	for(ll j=0;j<Q[u].size();j++){
		ll i=Q[u][j];
		if(query[i].x==u){
			if(vis[query[i].y]){
				query[i].lca=find(query[i].y);
			}
		}else{
			if(vis[query[i].x]){
				query[i].lca=find(query[i].x);
			}
		}
	}

}

int main(){
    scanf("%d%d%d", &n, &m, &s);
	for(ll i=0;i<maxn;i++) fa[i]=i;
	for(ll i=1;i<n;i++){
		ll u,v;scanf("%d%d",&u,&v);
		vec[u].push_back(v);
		vec[v].push_back(u);
	}
	for(ll i=1;i<=m;i++){
		scanf("%d%d", &query[i].x, &query[i].y);
		Q[query[i].x].push_back(i);
		Q[query[i].y].push_back(i);
	}
	tarjan(s);
	for(ll i=1;i<=m;i++){
		 printf("%d\n", query[i].lca);
	}
}