| Time Limit: 1000MS | Memory Limit: 10000K | |
| Total Submissions: 8254 | Accepted: 3772 |
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.
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.
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
点双连通分量模板题
1 /*by SilverN*/ 2 #include<algorithm> 3 #include<iostream> 4 #include<cstring> 5 #include<cstdio> 6 #include<cmath> 7 #include<vector> 8 using namespace std; 9 const int mxn=1210; 10 struct edge{ 11 int v,nxt; 12 }e[mxn<<2]; 13 int hd[mxn],mct=0; 14 void add_edge(int u,int v){ 15 e[++mct].v=v;e[mct].nxt=hd[u];hd[u]=mct; 16 return; 17 } 18 int n; 19 int low[mxn],dfn[mxn],dtime=0; 20 int num[mxn]; 21 int st[mxn],top=0; 22 bool cut[mxn]; 23 void DFS(int u,int fa){ 24 low[u]=dfn[u]=++dtime; 25 st[++top]=u; 26 int i,j; 27 for(i=hd[u];i;i=e[i].nxt){ 28 int v=e[i].v; 29 if(v==fa)continue; 30 if(!dfn[v]){ 31 DFS(v,u); 32 if(low[v]>=dfn[u]){ 33 cut[u]=1; 34 int s=0; 35 do{ 36 s=st[top--]; 37 ++num[s]; 38 }while(u!=s); 39 top++; 40 } 41 // num[u]++; 42 low[u]=min(low[u],low[v]); 43 } 44 else low[u]=min(dfn[v],low[u]); 45 } 46 return; 47 } 48 bool have[mxn]; 49 int main(){ 50 int cas=0; 51 while(1){ 52 memset(hd,0,sizeof hd); 53 memset(cut,0,sizeof cut); 54 memset(low,0,sizeof low); 55 memset(dfn,0,sizeof dfn); 56 memset(have,0,sizeof have); 57 memset(num,0,sizeof num); 58 mct=dtime=top=0; 59 int i,j,u,v; 60 bool flag=0; 61 while(scanf("%d",&u) && u){ 62 scanf("%d",&v); 63 have[u]=have[v]=1; 64 add_edge(u,v); 65 add_edge(v,u); 66 flag=1; 67 } 68 if(!flag)break; 69 for(i=1;i<=1000;i++) 70 if(have[i] && !dfn[i])DFS(i,0); 71 printf("Network #%d ",++cas); 72 flag=0; 73 for(i=1;i<=1000;i++){ 74 if(num[i]>=2){ 75 flag=1; 76 printf(" SPF node %d leaves %d subnets ",i,num[i]); 77 } 78 } 79 if(!flag)printf(" No SPF nodes "); 80 printf(" "); 81 } 82 return 0; 83 }