UVA 315 无向图 求割点

B - 无向图求割点

Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu

Submit Status Practice UVA 315

Description

A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N. No two places have the same number. The lines are bidirectional and always connect together two places and in each place the lines end in a telephone exchange. There is one telephone exchange in each place. From each place it is possible to reach through lines every other place, however it need not be a direct connection, it can go through several exchanges. From time to time the power supply fails at a place and then the exchange does not operate. The officials from TLC realized that in such a case it can happen that besides the fact that the place with the failure is unreachable, this can also cause that some other places cannot connect to each other. In such a case we will say the place (where the failure occured) is critical. Now the officials are trying to write a program for finding the number of all such critical places. Help them.

Input

The input file consists of several blocks of lines. Each block describes one network. In the first line of each block there is the number of places N < 100. Each of the next at most N lines contains the number of a place followed by the numbers of some places to which there is a direct line from this place. These at most N lines completely describe the network, i.e., each direct connection of two places in the network is contained at least in one row. All numbers in one line are separated by one space. Each block ends with a line containing just 0. The last block has only one line with N = 0.

Output

The output contains for each block except the last in the input file one line containing the number of critical places.

Sample Input

55 1 2 3 4062 1 35 4 6 200

Sample Output

12

题意： 给出一张无向图，求割点的个数

思路：很裸的题目，直接套用模版即可。

/**求割点一个顶点u是割点，当且仅当满足(1)或(2)(1) u为树根，且u有多于一个子树。(2) u不为树根，且满足存在(u,v)为树枝边(或称 父子边，即u为v在搜索树中的父亲)，使得 dfn(u)<=low(v)。（也就是说 V 没办法绕过 u 点到达比 u dfn要小的点）注：这里所说的树是指，DFS下的搜索树*/#include <iostream>#include <algorithm>#include <cstring>#include <cstdio>#include <cstdlib>#include <vector>using namespace std;#define N 10010int dfn[N];  ///代表最先遍历到这个点的时间int low[N];///这个点所能到达之前最早的时间点int Father[N];///保存这个节点的父亲节点int n,Time;vector<vector<int> >G;void init(){    G.clear();    G.resize(n+1);    memset(low,0,sizeof(low));    memset(dfn,0,sizeof(dfn));    memset(Father,0,sizeof(Father));    Time=0;}void Tarjan(int u,int fa){    low[u]=dfn[u]=++Time;    Father[u]=fa;    int len=G[u].size(), v;    for(int i=0;i<len;i++)    {        v=G[u][i];        if(!dfn[v])        {            Tarjan(v,u);            low[u]=min(low[u],low[v]);        }        else if(fa!=v)            low[u]=min(dfn[v],low[u]);    }}void solve(){    int Rootson=0,ans=0;  ///根节点儿子的数量    bool Cut[N]={false};///标记数组，判断这个点是否是割点    Tarjan(1,0);    for(int i=2;i<=n;i++)    {        int v=Father[i];        if(v==1)  ///也是就说 i的父亲是根节点            Rootson++;        else if(dfn[v]<=low[i])  ///判断是否满足条件（2）            Cut[v]=true;    }    for(int i=2;i<=n;i++)    {        if(Cut[i])            ans++;    }    if(Rootson>1)  ///满足条件（1）        ans++;    printf("%d\n",ans);}int main(){    while(scanf("%d",&n),n)    {        int a,b;        char ch;        init();        while(scanf("%d",&a),a)        {            while(scanf("%d%c",&b,&ch))            {                G[a].push_back(b);                G[b].push_back(a);                if(ch=='\n')                    break;            }        }        solve();    }    return 0;}