POJ1523 SPF tanjar割点求块数

题目链接

---

这道题求把点割了之后分的块数，在tanjar中每次遇到low[v]>=dfn[u]且u！=pre就是割点，cut[i]表示i是否为割点，block[i]表示删除一个割点i增加的联通分量数，该题所求删除一个点后的连通分量数，那么还需要加上不删除时本身的联通分量，所以answer+1;

代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<set>
#include<stack>
#include<vector>
#include<map>
#include<queue>
#define myself i,l,r
#define lson i<<1
#define rson i<<1|1
#define Lson i<<1,l,mid
#define Rson i<<1|1,mid+1,r
#define half (l+r)/2
#define inff 0x3f3f3f3f
#define lowbit(x) x&(-x)
#define PI 3.14159265358979323846
#define min4(a,b,c,d) min(min(a,b),min(c,d))
#define min3(x,y,z) min(min(x,y),min(y,z))
#define pii make_pair
#define pr pair<int,int>
const int dir[4][2]= {0,-1,-1,0,0,1,1,0};
typedef long long ll;
const ll inFF=9223372036854775807;
typedef unsigned long long ull;
using namespace std;
const int maxn=2e4+5;
int low[maxn],dfn[maxn],cut[maxn],block[maxn];
int Stack[maxn],inStack[maxn],head[maxn],vis[maxn];
int sign,t,top,cnt,n=1000;
struct node
{
    int to,p;
}edge[maxn<<1];
void add(int u,int v)
{
    edge[sign]=node{v,head[u]};
    head[u]=sign++;
}
void init()
{
    t=top=sign=cnt=0;
    for(int i=0;i<=n;i++)
    {
        head[i]=-1;
        cut[i]=dfn[i]=inStack[i]=block[i]=vis[i]=0;
    }
}
void tanjar(int u,int pre)
{
    dfn[u]=low[u]=++t;
    Stack[++top]=u;
    inStack[u]=1;
    int son=0;
    for(int i=head[u];~i;i=edge[i].p)
    {
        int v=edge[i].to;
        if(vis[i/2]) continue;
        vis[i/2]=1;
        if(!dfn[v])
        {
            son++;
            tanjar(v,u);
            low[u]=min(low[v],low[u]);
            if(u!=pre&&low[v]>=dfn[u])
            {
                cnt++;
                cut[u]=1;
                block[u]+=1;
            }
        }
        else low[u]=min(low[u],dfn[v]);
    }
    if(u==pre) block[u]=son-1;
    if(u==pre&&son>1) cut[u]=1,cnt++;
    inStack[top--]=0;
}
int main()
{
    int x,y,cas=0;
    while(scanf("%d",&x),x!=0)
    {
        scanf("%d",&y);
        init();
        add(x,y),add(y,x);
        while(scanf("%d",&x),x!=0)
        {
            scanf("%d",&y);
            add(x,y),add(y,x);
        }
        for(int i=1;i<=1000;i++)
            if(!dfn[i])
                tanjar(i,i);
        printf("Network #%d\n",++cas);
        if(cnt==0) puts("  No SPF nodes");
        else
        {
            for(int i=1;i<=1000;i++)
                if(cut[i]) printf("  SPF node %d leaves %d subnets\n",i,block[i]);
        }
        printf("\n");
    }
    return 0;
}