道路相遇【一般图的圆方树-广义圆方树】

题目链接

---

  刚开始拿到这道题的时候，先写了Tarjan缩点构树，没过样例，但是先把40分拿到了。

   然后再想，就如同样例给出的那样，我们所定义的原点和方点，实际上在Tarjan直接缩点上并不能起到直接体现的作用，所以这里要用到一般图的圆方树模板了，就是一道模板题了，直接上广义圆方树，然后求一个LCA即可。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e6 + 7, maxM = 2e6 + 7;
int N, M, Q;
struct Graph
{
    int head[maxN], cnt;
    struct Eddge
    {
        int nex, to;
        Eddge(int a=-1, int b=0):nex(a), to(b) {}
    } edge[maxM << 1];
    inline void addEddge(int u, int v)
    {
        edge[cnt] = Eddge(head[u], v);
        head[u] = cnt++;
    }
    inline void _add(int u, int v) { addEddge(u, v); addEddge(v, u); }
    inline void init()
    {
        cnt = 0;
        for(int i=1; i<=N; i++) head[i] = -1;
    }
} Old, Now;
int dfn[maxN], tot, low[maxN], Stap[maxN], Stop, Belong[maxN], Bcnt;
void Tarjan(int u, int fa)
{
    dfn[u] = low[u] = ++tot;
    Stap[++Stop] = u;
    for(int i=Old.head[u], v, p; ~i; i=Old.edge[i].nex)
    {
        v = Old.edge[i].to;
        if(v == fa) continue;
        if(!dfn[v])
        {
            Tarjan(v, u);
            low[u] = min(low[u], low[v]);
            if(low[v] >= dfn[u])
            {
                Bcnt++; Now.head[Bcnt + N] = -1;
                do
                {
                    p = Stap[Stop--];
                    Now._add(p, N + Bcnt);
                } while(p ^ v);
                Now._add(u, N + Bcnt);
            }
        }
        else low[u] = min(low[u], dfn[v]);
    }
}
int deep[maxN], Fpoint[maxN], root[maxN][22], LOG2[maxN];
void dfs(int u, int fa)
{
    deep[u] = deep[fa] + 1; Fpoint[u] = Fpoint[fa] + (u > N ? 1 : 0); root[u][0] = fa;
    for(int i=0; (1 << (i + 1)) < N; i++) root[u][i + 1] = root[root[u][i]][i];
    for(int i=Now.head[u], v; ~i; i=Now.edge[i].nex)
    {
        v = Now.edge[i].to;
        if(v == fa) continue;
        dfs(v, u);
    }
}
inline int _LCA(int u, int v)
{
    if(deep[u] < deep[v]) swap(u, v);
    int det = deep[u] - deep[v];
    for(int i=LOG2[det]; i>=0; i--)
    {
        if((det >> i) & 1) u = root[u][i];
    }
    if(u == v) return u;
    for(int i=LOG2[N]; i>=0; i--)
    {
        if(root[u][i] ^ root[v][i])
        {
            u = root[u][i];
            v = root[v][i];
        }
    }
    return root[u][0];
}
inline void init()
{
    tot = Stop = Bcnt = 0;
    Old.init(); Now.init();
    for(int i = 1, j = 2, k = 0; i <= 2 * N; i++)
    {
        if(i == j) { k++; j <<= 1; }
        LOG2[i] = k;
    }
}
int main()
{
    scanf("%d%d", &N, &M);
    init();
    for(int i=1, u, v; i<=M; i++)
    {
        scanf("%d%d", &u, &v);
        Old._add(u, v);
    }
    for(int i=1; i<=N; i++) if(!dfn[i]) Tarjan(i, 0);
    deep[0] = 0;
    dfs(1, 0);
    scanf("%d", &Q);
    int u, v, lca, dis, fpt;
    while(Q--)
    {
        scanf("%d%d", &u, &v);
        lca = _LCA(u, v);
        dis = deep[u] + deep[v] - deep[lca] - deep[root[lca][0]];
        fpt = Fpoint[u] + Fpoint[v] - Fpoint[lca] - Fpoint[root[lca][0]];
        printf("%d\n", dis - fpt);
    }
    return 0;
}