tarjan割点模板

#include "iostream"
#include "cstdio"
#include "cstdlib"
#include "cstring"
#include "cmath"
#include "algorithm"
#include "queue"
#include "vector"
#include "stack"
#include "map"
#include "set"

using namespace std;

typedef long long ll;
const int maxn = 20010;

int n, m;
vector<int> E[maxn];
int low[maxn], dfn[maxn];
set<int> res;
int timing;

void tarjan(int u, int root) {
	low[u] = dfn[u] = ++timing;
	int cnt = 0;
	for(int v = 0; v < E[u].size(); ++v) {
		if(!dfn[E[u][v]]) {
			cnt++;
			tarjan(E[u][v], root);
			low[u] = min(low[u], low[E[u][v]]);
			if(u != root && low[E[u][v]] >= dfn[u]) {
				res.insert(u);	
			}
		}
		low[u] = min(low[u], dfn[E[u][v]]);
	}
	if(cnt >= 2 && u == root) {
		res.insert(u);
	}
}

int main() {
	cin >> n >> m;
	for(int i = 1; i <= m; ++i) {
		int x, y;
		cin >> x >> y;
		E[x].push_back(y);
		E[y].push_back(x);
	}
	for(int i = 1; i <= n; ++i) {
		if(!dfn[i]) {
			tarjan(i, i);
		}
	}
	cout << res.size() << endl;
	for(set<int>::iterator it = res.begin(); it != res.end(); ++it) {
		cout << *it << " ";
	}
	cout << endl;
	return 0;
}