poj1144--D - Network（连通分量，割点）

时间：2014-08-26 15:35:56 阅读：401 评论：0 收藏：0 [点我收藏+]

D - Network

Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u

Submit Status

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

Sample Output

1
2

Hint

You need to determine the end of one line.In order to make it‘s easy to determine,there are no extra blank before the end of each line.

给出n个点，还有点u连接的边，求解有多少割点

注意，对于根来说，只有子树大于一个才会是割点。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
using namespace std;
#define maxn 120
struct node
{
    int u , v ;
    int next ;
} edge[1000000];
int head[maxn] , cnt , vis[1000000] ;
int dnf[maxn] , low[maxn] , time , ans , flag[maxn] , num ;
stack <int> sta;
void add(int u,int v)
{
    edge[cnt].u = u ;
    edge[cnt].v = v ;
    edge[cnt].next = head[u] ;
    head[u] = cnt++ ;
    edge[cnt].u = v ;
    edge[cnt].v = u ;
    edge[cnt].next = head[v] ;
    head[v] = cnt++ ;
}
void tarjan(int u)
{
    dnf[u] = low[u] = ++time ;
    int v , i , j ;
    for( i = head[u] ; i != -1 ; i = edge[i].next )
    {
        if( vis[i] ) continue ;
        if(u == 1)
            num++ ;
        vis[i] = vis[ i^1 ] = 1 ;
        v = edge[i].v ;
        if( !dnf[v] )
        {
            sta.push(i) ;
            tarjan(v) ;
            low[u] = min( low[u],low[v] );
            if( low[v] >= dnf[u] && !flag[u])
            {
                ans++ ;
                flag[u] = 1 ;
            }
        }
        else if( dnf[v] < dnf[u] )
        {
            sta.push(v) ;
            low[u] = min( low[u],dnf[v] );
        }
    }
}
int main()
{
    int n , m , u , v ;
    char ch ;
    while(scanf("%d", &n) && n)
    {
        memset(head,-1,sizeof(head));
        memset(vis,0,sizeof(vis));
        memset(dnf,0,sizeof(dnf));
        memset(low,0,sizeof(low));
        memset(flag,0,sizeof(flag)) ;
        cnt = time = ans = num = 0 ;
        while(scanf("%d", &u) && u)
        {
            while(scanf("%d%c", &v, &ch) )
            {
                add(u,v);
                if(ch == '\n')
                    break;
            }
        }
        while( !sta.empty() )
            sta.pop();
        tarjan(1);
        if(num == 1)
            ans--;
        printf("%d\n", ans);
    }
    return 0;
}

poj1144--D - Network（连通分量，割点）

原文：http://blog.csdn.net/winddreams/article/details/38847013

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年09月23日 (328)
2021年09月24日 (313)
2021年09月17日 (191)
2021年09月15日 (369)
2021年09月16日 (411)
2021年09月13日 (439)
2021年09月11日 (398)
2021年09月12日 (393)
2021年09月10日 (160)
2021年09月08日 (222)