POJ1523 SPF[无向图割点]

SPF

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 8139		Accepted: 3723

Description

Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure of a single node, 3, in the network on the left would prevent some of the still available nodes from communicating with each other. Nodes 1 and 2 could still communicate with each other as could nodes 4 and 5, but communication between any other pairs of nodes would no longer be possible.

Node 3 is therefore a Single Point of Failure (SPF) for this network. Strictly, an SPF will be defined as any node that, if unavailable, would prevent at least one pair of available nodes from being able to communicate on what was previously a fully connected network. Note that the network on the right has no such node; there is no SPF in the network. At least two machines must fail before there are any pairs of available nodes which cannot communicate. 

Input

The input will contain the description of several networks. A network description will consist of pairs of integers, one pair per line, that identify connected nodes. Ordering of the pairs is irrelevant; 1 2 and 2 1 specify the same connection. All node numbers will range from 1 to 1000. A line containing a single zero ends the list of connected nodes. An empty network description flags the end of the input. Blank lines in the input file should be ignored.

Output

For each network in the input, you will output its number in the file, followed by a list of any SPF nodes that exist.

The first network in the file should be identified as "Network #1", the second as "Network #2", etc. For each SPF node, output a line, formatted as shown in the examples below, that identifies the node and the number of fully connected subnets that remain when that node fails. If the network has no SPF nodes, simply output the text "No SPF nodes" instead of a list of SPF nodes.

Sample Input

1 2
5 4
3 1
3 2
3 4
3 5
0

1 2
2 3
3 4
4 5
5 1
0

1 2
2 3
3 4
4 6
6 3
2 5
5 1
0

0

Sample Output

Network #1
  SPF node 3 leaves 2 subnets

Network #2
  No SPF nodes

Network #3
  SPF node 2 leaves 2 subnets
  SPF node 3 leaves 2 subnets

Source

Greater New York 2000

---

cut vertex裸题，只不过求的是能分成几个subnets，使成为割点的子节点数+1就行(还有父辈们一个)，注意root不能加1

输入输出格式有点坑

//
//  main.cpp
//  poj1523
//
//  Created by Candy on 9/26/16.
//  Copyright © 2016 Candy. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int N=1e3+,INF=1e9+;
inline int read(){
    char c=getchar();int x=,f=;
    while(c<''||c>''){if(c=='-')f=-;c=getchar();}
    while(c>=''&&c<=''){x=x*+c-'';c=getchar();}
    return x;
}
int n=,u,v,w,cas=;
struct edge{
    int v,ne;
}e[N*N];
int h[N],cnt=;
inline void ins(int u,int v){
    cnt++;
    e[cnt].v=v;e[cnt].ne=h[u];h[u]=cnt;
    cnt++;
    e[cnt].v=u;e[cnt].ne=h[v];h[v]=cnt;
}
int pre[N],sn[N],dc=;
int dfs(int u,int fa){
    int lowu=pre[u]=++dc,child=;
    for(int i=h[u];i;i=e[i].ne){
        int v=e[i].v;
        if(!pre[v]){
            child++;
            int lowv=dfs(v,u);
            lowu=min(lowu,lowv);
            if(lowv>=pre[u]) sn[u]++;//,printf("v %d %d\n",u,v);
        }else if(pre[v]<pre[u]&&v!=fa)
            lowu=min(lowu,pre[v]);
    }
    if(fa==-&&child==) sn[u]=;
    return lowu;
}
int main(int argc, const char * argv[]) {
    while((u=read())){
        int root=,flag=; n=;
        memset(h,,sizeof(h)); cnt=;
        memset(pre,,sizeof(pre));
        memset(sn,,sizeof(sn));
        v=read();
        ins(u,v);
        n=max(n,max(u,v));
        while((u=read())){
            v=read();
            ins(u,v);
            n=max(n,max(u,v)); root=u;
        }
        dfs(root,-);
        if(sn[root]!=) sn[root]--;
        printf("Network #%d\n",++cas);
        for(int i=;i<=n;i++) if(sn[i]){
            printf("  SPF node %d leaves %d subnets\n",i,sn[i]+);
            flag=;
        }
        if(!flag) printf("  No SPF nodes\n");
        printf("\n");
    }

    return ;
}