【模板】 倍增lca

虽然很基础，但是还是复习了一下，毕竟比树剖好写。。。

代码:

#include<iostream>
#include<cstdio>
#include<cmath>
#include<ctime>
#include<queue>
#include<algorithm>
#include<cstring>
using namespace std;
#define duke(i,a,n) for(int i = a;i <= n;i++)
#define lv(i,a,n) for(int i = a;i >= n;i--)
#define clean(a) memset(a,0,sizeof(a))
const int INF =  << ;
const int N = ;
typedef long long ll;
typedef double db;
template <class T>
void read(T &x)
{
    char c;
    bool op = ;
    while(c = getchar(), c < '' || c > '')
        if(c == '-') op = ;
    x = c - '';
    while(c = getchar(), c >= '' && c <= '')
        x = x *  + c - '';
    if(op) x = -x;
}
template <class T>
void write(T x)
{
    if(x < ) putchar('-'), x = -x;
    if(x >= ) write(x / );
    putchar('' + x % );
}
struct node
{
    int l,r,nxt;
}a[];
int n,m,s;
int lst[],len = ;
void add(int x,int y)
{
    a[++len].l = x;
    a[len].r = y;
    a[len].nxt = lst[x];
    lst[x] = len;
}
int st[][];
int dep[];
void dfs(int u,int fa,int depth)
{
    dep[u] = depth;
    st[u][] = fa;
    for(int i = ;( << i) <= dep[u];i++)
    {
        st[u][i] = st[st[u][i - ]][i - ];
    }
    for(int k = lst[u];k;k = a[k].nxt)
    {
        int y = a[k].r;
        if(y == fa) continue;
        dfs(y,u,depth + );
    }
}
int lca(int x,int y)
{
    if(dep[x] > dep[y])
    swap(x,y);
    int ch = dep[y] - dep[x];
    duke(i,,)
    {
        if(ch & ( << i))
        y = st[y][i];
    }
    if(x == y)
    return x;
    lv(i,,)
    {
        if(st[x][i] != st[y][i])
        {
            x = st[x][i];
            y = st[y][i];
        }
    }
    x = st[x][];
    return x;
}
int main()
{
    read(n);read(m);read(s);
    duke(i,,n - )
    {
        int x,y;
        read(x);read(y);
        add(x,y);
        add(y,x);
    }
    dfs(s,,);
    int g,h;
    duke(i,,m)
    {
        read(g);read(h);
        printf("%d\n",lca(g,h));
    }
    return ;
}