Light OJ 1291 - Real Life Traffic （构造双连通图）

传送门：http://lightoj.com/volume_showproblem.php?problem=1291
http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=27001

题目大意：给定无向图，求最少添加多少条边使各个点至少在一个简单环中。

解题思路：添边构造双连通图，通过Tarjian求出各个双连通分支后缩点，统计出树中度为1的节点的个数，即为叶节点的个数，记为leaf。则至少在树上添加(leaf+1)/2条边，就能使树达到边二连通，所以至少添加的边数就是(leaf+1)/2。具体方法为，首先把两个最近公共祖先最远的两个叶节点之间连接一条边，这样可以把这两个点到祖先的路径上所有点收缩到一起，因为一个形成的环一定是双连通的。然后再找两个最近公共祖先最远的两个叶节点，这样一对一对找完，恰好是(leaf+1)/2次，把所有点收缩到了一起。（证明来自于下面Byvoid的博客链接）

参考：https://www.byvoid.com/blog/biconnect/

Code：

/*   W          w           w        mm          mm             222222222       7777777777777    */
/*    W        w w         w        m  m        m  m          222        22              7777    */
/*    w        w w         w        m  m        m  m                     22              777     */
/*     w      w   w       w        m    m      m    m                    22              77      */
/*     w      w    w      w        m    m      m    m                 222                77      */
/*      w    w      w    w        m      m    m      m              222                  77      */
/*      w    w      w    w        m      m    m      m            222                    77      */
/*       w  w        w  w        m        m  m        m         222                      77      */
/*       w  w        w  w        m        m  m        m      222                         77      */
/*        ww          ww        m          mm          m     222222222222222             77      */

//#pragma comment(linker, "/STACK:102400000,102400000")
//C++
//int size = 256 << 20; // 256MB
//char *p = (char*)malloc(size) + size;
//__asm__("movl %0, %%esp\n" :: "r"(p));
//G++
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<ctime>
#include<deque>
#include<cmath>
#include<vector>
#include<string>
#include<cctype>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>
#define REP(i,s,t) for(int i=(s);i<=(t);i++)
#define REP2(i,t,s) for(int i=(t);i>=s;i--)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned long ul;

const int MAXN=10005;
const int MAXM=40005;
int T;
int n,m;
struct BCC
{
    struct Edge
    {
        int to,next;
        bool cut;//是否是桥标记
    } edge[MAXM];
    int head[MAXN],tot;
    int Low[MAXN],DFN[MAXN],Stack[MAXN],Belong[MAXN];//Belong数组的值是1~block
    int Index,top;
    int degree[MAXN];
    int block;//边双连通块数
    bool Instack[MAXN];
    int bridge;//桥的数目
    void init()
    {
        Index=block=tot=0;
        memset(DFN,0,sizeof(DFN));
        memset(Instack,0,sizeof(Instack));
        memset(head,-1,sizeof(head));
        memset(degree,0,sizeof(degree));
    }
    void addedge(int u,int v)
    {
        edge[tot].to = v;
        edge[tot].next = head[u];
        edge[tot].cut=false;
        head[u] = tot++;
    }
    void Tarjan(int u,int pre)
    {
        int v;
        Low[u] = DFN[u] = ++Index;
        Stack[top++] = u;
        Instack[u] = true;
        for(int i = head[u]; i != -1; i = edge[i].next)
        {
            v = edge[i].to;
            if(v == pre)continue;
            if( !DFN[v] )
            {
                Tarjan(v,u);
                if( Low[u] > Low[v] )Low[u] = Low[v];
                if(Low[v] > DFN[u])
                {
                    bridge++;
                    edge[i].cut = true;
                    edge[i^1].cut = true;
                }
            }
            else if( Instack[v] && Low[u] > DFN[v] )
                Low[u] = DFN[v];
        }
        if(Low[u] == DFN[u])
        {
            block++;
            do
            {
                v = Stack[--top];
                Instack[v] = false;
                Belong[v] = block;
            }
            while( v!=u );
        }
    }
    int find_bcc()
    {
        for(int i=0; i<n; i++)
        {
            if(!DFN[i])
            {
                Tarjan(i,-1);
            }
        }
    }
    int solve()
    {
        memset(degree,0,sizeof(degree));
        for(int i=0;i<n;i++)
        {
            for(int j=head[i];j!=-1;j=edge[j].next)
            {
                int v=edge[j].to;
                if(Belong[i]!=Belong[v])
                {
                    degree[Belong[i]]++;
                }
            }
        }
        int ans=0;
        for(int i=1;i<=n;i++)
        {
            if(degree[i]==1)
            {
                ans++;
            }
        }
        return (ans+1)/2;
    }
    void debug()
    {
        for(int i=0; i<n; i++)
        {
            printf("Belong[%d]=%d\n",i,Belong[i]);
        }
        for(int i=1;i<=n;i++)
        {
            printf("degree[%d]=%d\n",i,degree[i]);
        }
    }
} solver;
int main()
{
#ifdef ONLINE_JUDGE
#else
    freopen("test.in","r",stdin);
#endif
    int ca=1;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        solver.init();
        REP(i,1,m)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            solver.addedge(u,v);
            solver.addedge(v,u);
        }
        solver.find_bcc();
        printf("Case %d: %d\n",ca++,solver.solve());
        //solver.debug();
    }
    return 0;
}