一个割点所在块个数就是去掉这个点之后的连通块个数。
tarjan求割点并记录块数即可。
注意此题很坑,标号并不一定是连续的…
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 1010
inline char gc(){
static char buf[1<<16],*S,*T;
if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
return x*f;
}
int h[N],n,num=0,fa[N],cnt[N],dfn[N],low[N],dfnum=0,tst=0;
struct edge{
int to,next;
}data[N*N];
inline void add(int x,int y){
data[++num].to=y;data[num].next=h[x];h[x]=num;
data[++num].to=x;data[num].next=h[y];h[y]=num;
}
inline void tarjan(int x){
dfn[x]=low[x]=++dfnum;
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(y==fa[x]) continue;
if(!dfn[y]){
fa[y]=x;tarjan(y);low[x]=min(low[x],low[y]);
if(!fa[x]){++cnt[x];continue;}
if(low[y]>=dfn[x]) ++cnt[x];
}else low[x]=min(low[x],dfn[y]);
}
}
int main(){
// freopen("a.in","r",stdin);
// freopen("a.out","w",stdout);
while(1){
int x=read();if(!x) break;int y=read();++tst;bool flag=0;
printf("Network #%d\n",tst);
memset(h,0,sizeof(h));num=0;memset(fa,0,sizeof(fa));
memset(cnt,0,sizeof(cnt));n=0;add(x,y);n=max(x,y);
memset(dfn,0,sizeof(dfn));dfnum=0;
while(1){
x=read();if(!x) break;y=read();add(x,y);n=max(n,max(x,y));
}for(int i=1;i<=n;++i) if(!dfn[i]) cnt[i]--,tarjan(i);
for(int i=1;i<=n;++i){
if(cnt[i]<=0) continue;flag=1;
printf(" SPF node %d leaves %d subnets\n",i,cnt[i]+1);
}if(!flag) puts(" No SPF nodes");puts("");
}return 0;
}