树剖求lca

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int MAXN=1000001;
int fst[MAXN<<1],nxt[MAXN<<1],a[MAXN],fa[MAXN];
int top[MAXN],deep[MAXN],size[MAXN],son[MAXN];
int tot,n,m,s;
struct hh
{
	int f,t;
}ma[MAXN<<1];

void build(int f,int t)
{
	ma[++tot]=(hh){f,t};
	nxt[tot]=fst[f];
	fst[f]=tot;
	return;
}
void dfs1(int x,int f)
{
	fa[x]=f;
	deep[x]=deep[f]+1;
	size[x]=1;
	for(int i=fst[x];i;i=nxt[i])
	{
		int v=ma[i].t;
		if(v==f) continue;
		dfs1(v,x);
		size[x]+=size[v];
		if(size[son[x]]<size[v]) son[x]=v;
	} 
	return;
}
void dfs2(int x,int st)
{
	top[x]=st;
	if(!son[x]) return;
	dfs2(son[x],st);
	for(int i=fst[x];i;i=nxt[i])
	{
		int v=ma[i].t;
		if(v==fa[x] || v==son[x]) continue;
		dfs2(v,v);
	}
	return;
}

int query(int x,int y)
{
	int fx=top[x],fy=top[y];
	while(fx!=fy)
	{
		if(deep[fx]<deep[fy]) swap(x,y),swap(fx,fy);
		x=fa[fx],fx=top[x];
	}
	return deep[x]>deep[y]?y:x;
}

void solve()
{
	int x,y;
	cin>>n>>m>>s;
	for(int i=1;i<n;i++)
	{
		scanf("%d%d",&x,&y);
		build(x,y);
		build(y,x);
	}
	dfs1(s,0),dfs2(s,s);
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d",&x,&y);
		printf("%d\n",query(x,y));
	}
	return;
}

int main()
{
	solve();
	return 0; 
 }