lightoj 1063 求割点

题目链接：http://lightoj.com/volume_showproblem.php?problem=1063

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
const int maxn = ;
const int INF = 0x3f3f3f;

vector<int> G[maxn];
int pre[maxn],low[maxn],dfs_clock;
bool iscut[maxn];
int ans;
int n,m;

void tarjan(int u,int fa){
    pre[u] = low[u] = dfs_clock++;
    int child = ;
    for(int i=;i<G[u].size();i++){
        int v = G[u][i];
        if(v == fa)  continue;
        if(!pre[v]){
            child++;
            tarjan(v,u);
            low[u] = min(low[u],low[v]);
            if(low[v] >= pre[u])  iscut[u] = true;
        }
        else
            low[u] = min(low[u],pre[v]);
    }
    if(fa == - && child == )  iscut[u] = false;
}
int main()
{
     //freopen("E:\\acm\\input.txt","r",stdin);
    int T;
    cin>>T;
    for(int t=;t<=T;t++){
        cin>>n>>m;
        memset(pre,,sizeof(pre));
        memset(iscut,,sizeof(iscut));
        dfs_clock = ;
        ans = ;
        for(int i=;i<=n;i++)   G[i].clear();
        for(int i=;i<=m;i++){
            int a,b;
            scanf("%d %d",&a,&b);
            G[a].push_back(b);
            G[b].push_back(a);
        }
        tarjan(,-);
        for(int i=;i<=n;i++)
            if(iscut[i]) ans++;
        printf("Case %d: %d\n",t,ans);
    }
}