LightOJ - 1291 Real Life Traffic(边双连通＋缩点)

题目大意：给你一张图，问将这张图变成一个边双连通块，至少要添加多少条边

解题思路：先求出所有的边双连通，然后缩点，桥为连接其中的点，这样就可以形成一棵树了，而需要添加的边的数量就是(叶结点的数量 + 1 ) / 2

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 10010;
const int M = 20010;

struct Edge{
    int u, v, next;
    Edge() {}
    Edge(int u, int v, int next): u(u), v(v), next(next) {}
}E[M * 2];

int head[N], pre[N], lowlink[N], bccno[N], Stack[N], num[N];
int tot, n, m, top, bcc_cnt, dfs_clock, cas = 1;

void AddEdge(int u, int v) {
    E[tot] = Edge(u, v, head[u]);
    head[u] = tot++;
    E[tot] = Edge(v, u, head[v]);
    head[v] = tot++;
}

void init() {
    scanf("%d%d", &n, &m);
    memset(head, -1, sizeof(head));
    tot = 0;

    int u, v;
    for (int i = 0; i < m; i++) {
        scanf("%d%d", &u, &v);
        AddEdge(u, v);
    }
}

void dfs(int u, int fa) {
    pre[u] = lowlink[u] = ++dfs_clock;
    Stack[++top] = u;
    for (int i = head[u]; ~i; i = E[i].next) {
        int v = E[i].v;
        if (!pre[v]) {
            dfs(v, u);
            lowlink[u] = min(lowlink[u], lowlink[v]);
            if (lowlink[v] > pre[u]) {
                int x;
                bcc_cnt++;
                while (1) {
                    x = Stack[top--];
                    bccno[x] = bcc_cnt;
                    if (x == v) break;
                }
            }
        }
        else if (v != fa && pre[v] < pre[u]) lowlink[u] = min(lowlink[u], pre[v]);
    }
}

void solve() {
    memset(pre, 0, sizeof(pre));
    memset(bccno, 0, sizeof(bccno));
    memset(num, 0, sizeof(num));
    dfs_clock = bcc_cnt = top = 0;
    dfs(0, -1);

    int u, v;
    for (int i = 0; i < tot; i += 2) {
        u = bccno[E[i].u];
        v = bccno[E[i].v];
        if (u == v) continue;
        num[u]++; num[v]++;
    }

    int ans = 0;
    for (int i = 0; i <= bcc_cnt; i++) {
        if (num[i] == 1) ans++;
    }
    printf("Case %d: %d\n", cas++ ,(ans + 1) / 2);

}

int main() {
    int test;
    scanf("%d", &test);
    while (test--) {
        init();
        solve();
    }
    return 0;
}