As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
给出一个 $n$ 个点，$m$ 条边的无向图，求图的割点。
第一行输入两个正整数 $n, m$。
下面 $m$ 行每行输入两个正整数 $x,y$ 表示 $x$ 到 $y$ 有一条边。
第一行输出割点个数。
第二行按照节点编号从小到大输出节点，用空格隔开。
6 7
1 2
1 3
1 4
2 5
3 5
4 5
5 61
5对于全部数据，$1 \leq n \leq 2 \times 10^4, 1 \leq x,y \leq n , 1 \leq m \leq 10^5$.
The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: