割点 割边 板子 UVA-796

这板子真好 

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<set>
#include<stack>
#include<vector>
#include<map>
#include<queue>
#define myself i,l,r
#define lson i<<1
#define rson i<<1|1
#define Lson i<<1,l,mid
#define Rson i<<1|1,mid+1,r
#define half (l+r)/2
#define inff 0x3f3f3f3f
#define lowbit(x) x&(-x)
#define PI 3.14159265358979323846
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define min3(x,y,z) min(min(x,y),min(y,z))
#define pii make_pair
#define pr pair<int,int>
const int dir[4][2]= {0,-1,-1,0,0,1,1,0};
typedef long long ll;
const ll inFF=9223372036854775807;
typedef unsigned long long ull;
using namespace std;
const int maxn=1e4+5;
int dfn[maxn],low[maxn],Stack[maxn],inStack[maxn],head[maxn],add_block[maxn];
bool cut[maxn];
int sign,n,t,top,bridge;
struct node
{
    int to,p;
    bool cut;
}edge[maxn*10];
void add(int u,int v)
{
    edge[sign]=node{v,head[u],false};
    head[u]=sign++;
}
void init()
{
    sign=t=top=bridge=0;
    for(int i=0;i<=n;i++)
    {
        head[i]=-1;
        cut[i]=false;
        dfn[i]=add_block[i]=inStack[i]=0;
    }
}
void tanjar(int u,int pre)
{
    dfn[u]=low[u]=++t;
    Stack[++top]=u;
    inStack[top]=1;
    int son=0;
    for(int i=head[u];~i;i=edge[i].p)
    {
        int v=edge[i].to;
        if(v==pre) continue;
        if(!dfn[v])
        {
            son++;
            tanjar(v,u);
            low[u]=min(low[u],low[v]);
            if(low[v]>dfn[u])
            {
                bridge++;
                edge[i].cut=true;
                edge[i^1].cut=true;
            }
            if(u!=pre&&low[v]>=dfn[u])
            {
                cut[u]=true;
                add_block[u]++;
            }
        }
        else low[u]=min(low[u],dfn[v]);
    }
    if(u==pre&&son>1) cut[u]=true;
    if(u==pre) add_block[u]=son-1;
    inStack[u]=0;
    top--;
}
void solve()
{
    for(int i=1;i<=n;i++) if(!dfn[i]) tanjar(i,i);
    printf("%d critical links\n",bridge);
    vector<pr>ans;
    for(int u=1;u<n;u++)
    {
        for(int i=head[u];~i;i=edge[i].p)
            if(edge[i].cut&&edge[i].to>u)
                ans.push_back(pii(u,edge[i].to));
    }
    sort(ans.begin(),ans.end());
    for(int i=0;i<ans.size();i++)
        printf("%d - %d\n",ans[i].first-1,ans[i].second-1);
    printf("\n");
}
int main()
{
    int x,y,k;
    while(scanf("%d",&n)==1)
    {
        init();
        for(int i=1;i<=n;i++)
        {
            scanf("%d (%d)",&x,&k);
            x++;
            while(k--)
            {
                scanf("%d",&y);
                y++;
                add(x,y),add(y,x);
            }
        }
        solve();
    }
    return 0;
}