tarjan割点 洛谷P3388模板

//
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")

//#pragma GCC optimize(3,"Ofast","inline")
//#include<unordered_map>
//#include<unordered_set>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<functional>
#include<cstring>
#include<string>
#include<cstdlib>
#include<queue>
#include<map>
#include<algorithm>
#include<set>
#include<stack>
#include<vector>
#include<sstream>
#include<list>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
ll mod=1000000007;
const int N=2e3+10;
const int maxn=1e7+7;
struct edge
{
    int from,to,next;
}e[maxn];
int num;
int a,b,n,m,t;
int dfn[maxn],low[maxn],head[maxn],vis[maxn],cnt[maxn];
set<int>ans;
void add(int from,int to)
{
    e[num]={from,to,head[from]};
    head[from]=num++;
}
void dfs(int root,int from,int x)
{
    dfn[x]=low[x]=++t;
    vis[x]=1;
    for(int i=head[x];i!=-1;i=e[i].next)
    {
        int to=e[i].to;
        if(to==from)continue;
        if(!vis[to])
        {
            dfs(root,x,to);
            cnt[x]++;
            low[x]=min(low[x],low[to]);
            if(low[to]>=dfn[x]&&x!=root)
            {
                ans.insert(x);
            }
        }
        else low[x]=min(low[x],dfn[to]);
    }
}
void tarjan()
{
    for(int i=1;i<=n;i++)
        if(!vis[i])
        {
            dfs(i,i,i);
            if(cnt[i]>=2)ans.insert(i);
        }
}
int main()
{
    memset(head,-1,sizeof head);
    cin>>n>>m;
    while(m--)
    {
        cin>>a>>b;
        add(a,b);
        add(b,a);
    }
    tarjan();
    cout<<ans.size()<<endl;
    for(set<int>::iterator it=ans.begin();it!=ans.end();it++)
        cout<<*it<<" ";
	return 0;
}