UVA 315 - Network（割点 tarjan）

A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connectingseveral places numbered by integers from 1 to N. No two places have the same number. The linesare bidirectional and always connect together two places and in each place the lines end in a telephoneexchange. There is one telephone exchange in each place. From each place it is possible to reachthrough lines every other place, however it need not be a direct connection, it can go through severalexchanges. From time to time the power supply fails at a place and then the exchange does not operate.The o cials from TLC realized that in such a case it can happen that besides the fact that the placewith 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 o cials are tryingto write a program for nding the number of all such critical places. Help them.

Input

The input le consists of several blocks of lines. Each block describes one network. In the rst lineof each block there is the number of places N < 100. Each of the next at most N lines contains thenumber 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 inthe network is contained at least in one row. All numbers in one line are separated by one space. Eachblock 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 le one line containing the number ofcritical places.

题意：

割点裸题。

#include <iostream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <string.h>
using namespace std;
const int maxn=111;
vector<int>G[maxn];
int DFN[maxn],low[maxn],inq[maxn];
int flag[maxn];
int n,tm,ans;
stack<int>q;
void init()
{
    for(int i=1;i<maxn;i++) G[i].clear();
    memset(DFN,0,sizeof DFN);
    memset(low,0,sizeof low);
    memset(inq,0,sizeof inq);
    memset(flag,0,sizeof flag);
    tm=0;
    ans=0;
    while(!q.empty()) q.pop();
}
void add(int u,int v)
{
    G[u].push_back(v);
    G[v].push_back(u);
}

void tarjan(int u,int pre)
{
    DFN[u]=low[u]=++tm;
    q.push(u);
    inq[u]=1;
    int son=0;
    for(int i=0;i<G[u].size();i++)
    {
        int v=G[u][i];
        if(v==pre) continue;
        if(DFN[v]==0)
        {
            son++;
            tarjan(v,u);
            if(low[u]>low[v]) low[u]=low[v];
            if(u!=pre&&low[v]>=DFN[u])
            {
                flag[u]=1;
                
            }
        }
        else if(inq[u]==1&&low[u]>DFN[v])
            low[u]=DFN[v];
    }
    if(u==pre&&son>1)
    {
        flag[u]=1;
    }
    inq[u]=0;
    q.pop();
        
}
int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        init();
        int u;
        while(scanf("%d",&u)&&u)
        {
            char ch;
            int v;
            while(scanf("%d%c",&v,&ch))
            {
                add(u,v);
                add(v,u);
                if(ch=='\n')
                    break;
            }
        }
        for(int i=1;i<=n;i++)
        {
            if(DFN[i]==0)
            {
                tarjan(i,i);
            }
        }
        for(int i=1;i<=n;i++) if(flag[i]) ans++;
        printf("%d\n",ans);
    }
}