POJ3694 tarjan求桥+LCA+并查集优化

题目链接
题目大意：给定一张有n个点，m条边的无向连通图。然后依次加入q条边，问你每加入一条边，图中还剩下多少桥。

1.先将图中进行tarjan缩点，因为（边）双联通分量都被缩成了一个点，因此缩点后的图是一棵树。点与点之间的边是桥。
2.对于每次添加一条边，首先看两个点是不是属于一个双联通分量，如果是的话，则桥的数量不变。否则找出两点的祖先，因为从两点到祖先的路径可以构成一条环，所以路径上的桥经过添加边后不再是桥，减去相应的数量即可。

如果用此思路的话，时间复杂度是O（m + q * n）
对于一条边连接父节点和子节点，可以将这条边是否是桥的信息记录在子节点，即数组vis[]，如果这条边被更新成不是桥，只需要修改vis[]。
代码如下，注释见代码

#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <vector>

#define x first
#define y second

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
const double eps = 1e-6;

const int N = 100010;
const int M = 4 * N; //注意是无向边，M是2e5，所以要4*N
int h[N], e[M], ne[M], idx;
int h2[N], ne2[M], e2[M], idx2;
int stk[N], top;
int dfn[N], low[N], timestamp;
int dcc_cnt, bridge[M], id[N], cnt;
int d[N], fa[N][18], vis[N];
int hh, tt, q[N];

//构建原始的图
void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}

//用来构建缩点后的树
void add2(int a, int b) 
{
    e2[idx2] = b, ne2[idx2] = h2[a], h2[a] = idx2 ++;
}

//多组数据读入，每次需要初始化
void init()
{
    memset(h, -1, sizeof h);
    memset(h2, -1, sizeof h2);
    idx = idx2 = dcc_cnt = timestamp = top = cnt = 0;
    memset(dfn, 0, sizeof dfn);
    memset(low, 0, sizeof low);
    memset(bridge, 0, sizeof bridge);
}

//tarjan求双联通分量
void tarjan(int u, int from)
{
    dfn[u] = low[u] = ++ timestamp;
    stk[++ top] = u;
    
    for (int i = h[u]; ~i; i = ne[i])
    {
        int j = e[i];
        if (!dfn[j])
        {
            tarjan(j, i);
            low[u] = min(low[u], low[j]);
            if (low[j] > dfn[u])
                bridge[i] = bridge[i ^ 1] = 1, cnt ++; //标记边是桥
        }
        else if ((i ^ 1) != from)   low[u] = min(low[u], dfn[j]);
    }
    if (dfn[u] == low[u]) //缩点
    {
        int y;
        ++ dcc_cnt;
        do{
            y = stk[top --];
            id[y] = dcc_cnt;  //记录点是属于哪个双联通分量
        }while(y != u);
    }
}

//求LCA的初始化
void bfs()
{
    memset(fa, 0, sizeof fa);
    memset(d, 0x3f, sizeof d);
    memset(vis, 0, sizeof vis);
    hh = 0, tt = 0;
    q[0] = 1, d[1] = 1, d[0] = 0;
    while(hh <= tt)
    {
        int t = q[hh ++];
        for (int i = h2[t]; ~i; i = ne2[i])
        {
            int j = e2[i];
            if (d[j] > d[t] + 1)
            {
                vis[j] = 1;
                d[j] = d[t] + 1;
                q[++ tt] = j;
                fa[j][0] = t;
                for (int k = 1; k < 18; k ++)
                    fa[j][k] = fa[fa[j][k - 1]][k - 1];
            }
        }
    }
}
//求LCA
int lca(int a, int b)
{
    if (d[a] < d[b])    swap(a, b);
    for (int i = 17; i >= 0; i --)
        if (d[fa[a][i]] >= d[b])
            a = fa[a][i];
    
    if (a == b) return a;
    for (int i = 17; i >= 0; i --)
    {
        if (fa[a][i] != fa[b][i])
        {
            a = fa[a][i];
            b = fa[b][i];
        }
    }
    return fa[a][0];
}

int main()
{
    int n, m, q;
    int T = 1;
    while (scanf("%d%d", &n, &m), n && m)
    {
        printf("Case %d:\n", T ++);
        init();
        for (int i = 0; i < m; i ++)
        {
            int a, b;
            scanf("%d%d", &a, &b);
            add(a, b), add(b, a);
        }
        tarjan(1, -1);
        //遍历每条边，如果是桥，则加入新建的图中
        for (int i = 0; i < 2 * m; i += 2)
            if (bridge[i])
            {
                int a = e[i];
                int b = e[i ^ 1];
                if (id[a] != id[b]);
                {
                    add2(id[a], id[b]), add2(id[b], id[a]);
                }
            }
        bfs();
        int q;
        scanf("%d", &q);
        while (q --)
        {
            int acnt = 0;
            int a, b;
            scanf("%d%d", &a, &b);
            if (id[a] == id[b])
            {
                printf("%d\n", cnt);
                continue;
            }
            a = id[a], b = id[b];
            int p = lca(a, b);
            //找出两点到祖先的桥的数量，然后减去
            while(d[p] < d[a])
            {
                if (vis[a]) vis[a] = 0, acnt ++;
                a = fa[a][0];
            }
            while(d[p] < d[b])
            {
                if (vis[b]) vis[b] = 0, acnt ++;
                    b = fa[b][0];
            }
            cnt -= acnt;
            printf("%d\n", cnt);
        }
        puts("");
    }
    return 0;
}

优化方法：使用并查集，每当一条边不再是桥时，就把这条边的子节点所在的集合合并到父节点的集合。时间复杂度O（m + q * logn）

#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <vector>

#define x first
#define y second

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
const double eps = 1e-6;

const int N = 100010;
const int M = 4 * N;
int h[N], e[M], ne[M], idx;
int h2[N], ne2[M], e2[M], idx2;
int stk[N], top;
int dfn[N], low[N], timestamp;
int dcc_cnt, bridge[M], id[N], cnt;
int d[N], fa[N][18], vis[N];
int hh, tt, q[N];
int anc[N];
int n, m;

void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++;
}

void add2(int a, int b)
{
    e2[idx2] = b, ne2[idx2] = h2[a], h2[a] = idx2 ++;
}

void init()
{
    memset(h, -1, sizeof h);
    memset(h2, -1, sizeof h2);
    idx = idx2 = dcc_cnt = timestamp = top = cnt = 0;
    memset(dfn, 0, sizeof dfn);
    memset(low, 0, sizeof low);
    memset(bridge, 0, sizeof bridge);
    for (int i = 1; i <= n; i ++)
        anc[i] = i;
}

void tarjan(int u, int from)
{
    dfn[u] = low[u] = ++ timestamp;
    stk[++ top] = u;
    
    for (int i = h[u]; ~i; i = ne[i])
    {
        int j = e[i];
        if (!dfn[j])
        {
            tarjan(j, i);
            low[u] = min(low[u], low[j]);
            if (low[j] > dfn[u])
                bridge[i] = bridge[i ^ 1] = 1, cnt ++;
        }
        else if ((i ^ 1) != from)   low[u] = min(low[u], dfn[j]);
    }
    if (dfn[u] == low[u])
    {
        int y;
        ++ dcc_cnt;
        do{
            y = stk[top --];
            id[y] = dcc_cnt;
        }while(y != u);
    }
}

void bfs()
{
    memset(fa, 0, sizeof fa);
    memset(d, 0x3f, sizeof d);
    memset(vis, 0, sizeof vis);
    hh = 0, tt = 0;
    q[0] = 1, d[1] = 1, d[0] = 0;
    while(hh <= tt)
    {
        int t = q[hh ++];
        for (int i = h2[t]; ~i; i = ne2[i])
        {
            int j = e2[i];
            if (d[j] > d[t] + 1)
            {
                vis[j] = 1;
                d[j] = d[t] + 1;
                q[++ tt] = j;
                fa[j][0] = t;
                for (int k = 1; k < 18; k ++)
                    fa[j][k] = fa[fa[j][k - 1]][k - 1];
            }
        }
    }
}

int lca(int a, int b)
{
    if (d[a] < d[b])    swap(a, b);
    for (int i = 17; i >= 0; i --)
        if (d[fa[a][i]] >= d[b])
            a = fa[a][i];
    
    if (a == b) return a;
    for (int i = 17; i >= 0; i --)
    {
        if (fa[a][i] != fa[b][i])
        {
            a = fa[a][i];
            b = fa[b][i];
        }
    }
    return fa[a][0];
}

int fin(int x)
{
    if (anc[x] == x) return x;
    return anc[x] = fin(anc[x]);
}

int main()
{
    int T = 1;
    while (scanf("%d%d", &n, &m), n && m)
    {
        printf("Case %d:\n", T ++);
        init();
        for (int i = 0; i < m; i ++)
        {
            int a, b;
            scanf("%d%d", &a, &b);
            add(a, b), add(b, a);
        }
        tarjan(1, -1);
        for (int i = 0; i < 2 * m; i += 2)
            if (bridge[i])
            {
                int a = e[i];
                int b = e[i ^ 1];
                if (id[a] != id[b]);
                {
                    add2(id[a], id[b]), add2(id[b], id[a]);
                    // printf("id[a]:%d  id[b]:%d\n", id[a], id[b]);
                    // cout << h2[3] << endl;
                }
            }
        // for (int i = 1; i <= n; i ++)
        //     printf("id:%d\n", id[i]);
        bfs();
        // for (int i = 1; i <= n; i ++)
        //     cout << fa[id[i]][0] << ' ' << vis[id[i]] << endl;
        int q;
        scanf("%d", &q);
        while (q --)
        {
            int acnt = 0;
            int a, b;
            scanf("%d%d", &a, &b);
            if (id[a] == id[b])
            {
                printf("%d\n", cnt);
                continue;
            }
            a = id[a], b = id[b];
            int p = lca(a, b);
            a = fin(a), b = fin(b);
            while(d[p] < d[a])
            {
                // printf("vis[a]:%d, a:%d\n", vis[a], a);
                acnt ++;
                anc[a] = fa[a][0];
                a = fin(a);
            }
            while(d[p] < d[b])
            {
                // printf("vis[b]:%d, b:%d\n", vis[b], b);
                acnt ++;
                anc[b] = fa[b][0];
                b = fin(b);
            }
            cnt -= acnt;
            printf("%d\n", cnt);
        }
        puts("");
    }
    return 0;
}