【Lightoj 1063 - Ant Hills】& 割点

After many years of peace, an ant-war has broken out.

In the days leading up to the outbreak of war, the ant government devoted a great deal of resources toward gathering intelligence on ant hills. It discovered the following:

1. The ant empire has a large network of ant-hills connected by bidirectional tracks.
2. It is possible to send a message from any ant hill to any other ant hill.

Now you want to stop the war. Since they sometimes attack your house and disturb you quite a lot. So, you have made a plan. You have a gun which can destroy exactly one ant-hill. So, you want to hit an ant hill if it can stop at least two other ant hills passing messages between them. Now you want the total number of ant hills you may choose to fire.

Input
Input starts with an integer T (≤ 20), denoting the number of test cases.

Each test case contains a blank line and two integers n (1 ≤ n ≤ 10000), m (1 ≤ m ≤ 20000). n denotes the number of ant hills and m denotes the number of bi-directional tracks. Each of the next m lines will contain two different integers a b (1 ≤ a, b ≤ n) denoting that there is a track between a and b.

Output
For each case, print the case number and the total number of ant hills you may choose to fire.

Sample Input
2

5 4
2 1
1 3
5 4
4 1

3 3
1 2
2 3
1 3
Sample Output
Case 1: 2
Case 2: 0

题意 ： 去掉 一个点 a 可以让至少两个以上的点不在联通，求这样的点有多少个

思路 ： 割点 （图论基础题？我之前学了假图论？QAQ）

AC代码：

#include<bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 10;
const int INF = 1e9 + 7;
typedef long long LL;
int n,m,nl,head[MAX * 4];
int lo[MAX],d[MAX],pl,p[MAX];
struct node{
    int to,next;
}st[MAX * 4];
void init(){
    nl = 0;
    pl = 1;
    memset(head,-1,sizeof head);
    memset(d,0,sizeof d);
    memset(lo,0,sizeof lo);
    memset(p,0,sizeof p);
}
void add(int x,int y){
    st[nl] = node{y,head[x]};
    head[x] = nl++;
}
void Tarjan(int u,int f){
    lo[u] = d[u] = pl++;
    int son = 0;
    for(int i = head[u]; i != -1; i = st[i].next){
        int v = st[i].to;
        if(v == f) continue;
        if(!d[v]){
            Tarjan(v,u);
            lo[u] = min(lo[u],lo[v]);
            if(f == -1 && son) p[u] = 1;
            if(f != -1 && lo[v] >= d[u]) p[u] = 1;
            son++;
        }
        else
            lo[u] = min(lo[u],d[v]);
    }
}
void input(){
    int x,y;
    scanf("%d %d",&n,&m);
    while(m--){
        scanf("%d %d",&x,&y);
        add(x,y);
        add(y,x);
    }
}
void solve(){
    for(int i = 1; i <= n; i++)
        if(!d[i])
            Tarjan(i,-1);
}
int main()
{
    int T,cas = 0;
    scanf("%d",&T);
    while(T--){
        init();
        input();
        solve();
        int ll = 0;
        for(int i = 1; i <= n; i++)
            if(p[i])
                ll++;
        printf("Case %d: %d\n",++cas,ll);
    }
    return 0;
}