Blow up the city【2019杭电多校】【支配树】

HDU-6604

---

  比灾难那道题还要简单了，灾难那道题怎么说还是要求一个树形DP的说。

  这道题就是个求深度，用深度来代表下面的支配点的数量（这个很好想的），然后如果存在公共祖先的话，我们直接用两者之后减去公共祖先的深度就可以了。

  也不完全说是一道支配树问题，可以简单的看作是拓扑排序加上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>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#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
#define MP(x, y) make_pair(x, y)
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 1e5 + 7;
int N, M, qes, du[maxN], tpsort[maxN], tp, siz[maxN], root[maxN][18], deep[maxN];
vector<int> g[maxN], rg[maxN], ng[maxN];
queue<int> Q;
inline void tuopu()
{
    tpsort[++tp] = 0;
    for(int i=1; i<=N; i++) if(!du[i])
        {
            Q.push(i);
            ng[0].push_back(i);
            g[i].push_back(0);
        }
    while(!Q.empty())
    {
        int u = Q.front(); Q.pop(); tpsort[++tp] = u;
        int len = (int)rg[u].size();
        for(int i=0, v; i<len; i++)
        {
            v = rg[u][i];
            du[v]--;
            if(!du[v]) Q.push(v);
        }
    }
}
inline int _lca(int x, int y)
{
    if(deep[x] < deep[y]) swap(x, y);
    int tmp = deep[x] - deep[y];
    for(int i=log2(1.*tmp); i>=0; i--)
    {
        if((1<<i) & tmp) x = root[x][i];
    }
    if(x == y) return x;
    for(int i=log2(1.*N); i>=0; i--)
    {
        if(root[x][i] != root[y][i])
        {
            x = root[x][i];
            y = root[y][i];
        }
    }
    return root[x][0];
}
inline void init()
{
    tp = 0;
    for(int i=1; i<=N; i++)
    {
        du[i] = deep[i] = 0;
        g[i].resize(0);
        rg[i].resize(0);
        ng[i].resize(0);
        for(int j=log2(N); j>=0; j--) root[i][j] = 0;
    }
    while(!Q.empty()) Q.pop();
}
int main()
{
    int T; scanf("%d", &T);
    while(T--)
    {
        scanf("%d%d", &N, &M);
        init();
        for(int i=1, u, v; i<=M; i++)
        {
            scanf("%d%d", &u, &v);
            g[u].push_back(v);
            rg[v].push_back(u);
            du[u]++;
        }
        tuopu();
        for(int i=2, x, y, len; i<=tp; i++)
        {
            x = tpsort[i]; y = g[x][0];
            len = (int)g[x].size();
            for(int j=1, v; j<len; j++)
            {
                v = g[x][j];
                y = _lca(y, v);
            }
            ng[y].push_back(x);
            deep[x] = deep[y] + 1;
            root[x][0] = y;
            for(int j=0; j<log2(1.*N); j++) root[x][j + 1] = root[root[x][j]][j];
        }
        scanf("%d", &qes);
        int a, b;
        while(qes--)
        {
            scanf("%d%d", &a, &b);
            printf("%d\n", deep[a] + deep[b] - deep[_lca(a, b)]);
        }
    }
    return 0;
}