割点、割边模板（tarjan）

割边：牛客小白月赛12- I

代码如下：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<cmath>
#include<set>
#include<map>
using namespace std;
#define ll long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef pair<int,int>P;
const int INF=0x3f3f3f3f;
const int N=100015,mod=32767;
struct A{
    int to,nex;
}edge[6*N];

int cnt,head[N],dfn[N],low[N];
set<P>qq;

void add(int from,int to){
    edge[cnt].to=to;
    edge[cnt].nex=head[from];
    head[from]=cnt++;
}

void tarjan(int dep,int u,int pre){
    low[u]=dfn[u]=dep;
    int v;
    for(int i=head[u];i!=-1;i=edge[i].nex){
        v=edge[i].to;
        if(dfn[v]==-1){
            tarjan(dep+1,v,u);
            low[u]=min(low[u],low[v]);
            if(low[v]>dfn[u]){
                qq.insert(P(u,v));
            }
        }
        else if(v!=pre){
            low[u]=min(low[u],dfn[v]);
        }
    }
}

int main(){
    int n,m,a,b;
    scanf("%d%d",&n,&m);
    memset(head,-1,sizeof(head));
    memset(dfn,-1,sizeof(dfn));
    for(int i=1;i<=m;i++){
        scanf("%d%d",&a,&b);
        add(a,b);
        add(b,a);
    }
    for(int i=1;i<=n;i++){
        if(dfn[i]==-1){
            tarjan(1,i,0);
        }
    }
    printf("%d\n",m-qq.size());
}

割点：洛谷P3388

代码如下：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<cmath>
#include<set>
#include<map>
using namespace std;
#define ll long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef pair<int,int>P;
const int INF=0x3f3f3f3f;
const int N=20015,mod=32767;
struct A{
    int to,nex;
}edge[200010];

int rt,rootson,cnt,head[N],dfn[N],low[N];
set<int>qq;

void add(int from,int to){
    edge[cnt].to=to;
    edge[cnt].nex=head[from];
    head[from]=cnt++;
}

void tarjan(int dep,int u,int pre){
    low[u]=dfn[u]=dep;
    int v;
    for(int i=head[u];i!=-1;i=edge[i].nex){
        v=edge[i].to;
        if(dfn[v]==-1){
            tarjan(dep+1,v,u);
            if(u==rt)rootson++;
            low[u]=min(low[u],low[v]);
            if(low[v]>=dfn[u]){
                qq.insert(u);
            }
        }
        else if(v!=pre){
            low[u]=min(low[u],dfn[v]);
        }
    }
}

int main(){
    int n,m,a,b;
    scanf("%d%d",&n,&m);
    memset(head,-1,sizeof(head));
    memset(dfn,-1,sizeof(dfn));
    for(int i=1;i<=m;i++){
        scanf("%d%d",&a,&b);
        add(a,b);
        add(b,a);
    }
    for(int i=1;i<=n;i++){
        if(dfn[i]==-1){
            rt=i;
            rootson=0;
            tarjan(1,i,0);
            if(rootson==1)qq.erase(i);
        }
    }
    printf("%d\n",qq.size());
    for(set<int>::iterator it=qq.begin();it!=qq.end();it++){
        if(it==qq.begin())printf("%d",*it);
        else printf(" %d",*it);
    }
    printf("\n");
}