无向图,给 n n n 个点, m m m 条边,求割点
其中回边更新的时候是 low[u]=min(low[u],dfn[v])
,而不是 low[u]=min(low[u],low[v])
,例子可参考 https://www.luogu.com.cn/blog/ztyluogucpp/solution-p3388
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 20010
#define MAXM 200010
using namespace std;
int n,m,head[MAXN],u,v,dfn[MAXN],low[MAXN],cut[MAXN],idx,cnt,res;
struct Edge{
int to,nxt;
}edge[MAXM];
void addedge(int u,int v){
edge[cnt].to=v;edge[cnt].nxt=head[u];
head[u]=cnt++;
edge[cnt].to=u;edge[cnt].nxt=head[v];
head[v]=cnt++;
}
void tarjan(int u,int p){
dfn[u]=low[u]=++idx;
int son=0;
for(int i=head[u];i!=-1;i=edge[i].nxt){
int v=edge[i].to;
if(!dfn[v]){
tarjan(v,u);
low[u]=min(low[u],low[v]);
if(low[v]>=dfn[u]&&u!=p)cut[u]=1;
if(u==p)son++;
}
low[u]=min(low[u],dfn[v]);
}
if(son>1&&u==p)cut[u]=1;
}
int main(){
#ifdef WINE
freopen("data.in","r",stdin);
#endif
memset(head,-1,sizeof(head));
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++){
scanf("%d%d",&u,&v);
addedge(u,v);
}
for(int i=1;i<=n;i++)
if(!dfn[i])tarjan(i,i);
for(int i=1;i<=n;i++)
if(cut[i])res++;
printf("%d\n",res);
for(int i=1;i<=n;i++)
if(cut[i])
printf("%d ",i);
return 0;
}