P3388【模板】割点（割顶）

合集 - 板子(13)

1.LCA板子2024-07-202.树状数组和线段树板子2024-07-023.P1504 积木城堡/01背包板子2024-05-264.Tarjan模板2024-05-09

5.P3388【模板】割点（割顶）2024-05-09

6.P1439 【模板】最长公共子序列2024-04-057.最长上升子序列LIS模板2024-04-058.图论板子2024-03-319.kmp板子2024-04-0210.P3805 【模板】manacher：回文字符串类题目2024-03-1011.数位dp板子：记忆化搜索2024-03-0712.点分治板子2024-08-0113.区间dp板子2024-10-11

收起

https://www.luogu.com.cn/problem/P3388
求割点模板

#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<sstream>
#include<string>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<map>
#include<queue>
#include<cmath>
#include<limits.h>
#include<climits>
#include<fstream>
#include<stack>
#include<set>
typedef long long ll;
using namespace std;



const int N = 1e5+5;
int low[N], num[N], dfn;
bool iscut[N];
int ans = 0;
int r = 0;
vector<int>G[N];
void dfs(int u, int fa)
{
	low[u] = num[u] = ++dfn;
	int child = 0;
	for (int i = 0; i < G[u].size(); i++)
	{
		int v = G[u][i];
		if (!num[v])
		{
			child++;
			dfs(v, u);
			low[u] = min(low[v], low[u]);
			if (low[v] >= num[u] and u != r)
			{
				iscut[u] = true;
			}
		}
		else  low[u] = min(low[u], num[v]);
	}
	if (u == r and child >= 2) 
	{
		iscut[u] = 1;
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int x, y; cin >> x >> y;
		G[x].push_back(y), G[y].push_back(x);
	}
	for(int i=1;i<=n;i++)
		if(!num[i])
		{
			r = i;
			dfs(i, i);
		}
	for (int i = 1; i <= n; i++)if (iscut[i])ans++;
	cout << ans << endl;
	for (int i = 1; i <= n; i++)if (iscut[i])cout << i << ' ';
	return 0;
}