CF920E.Connected Components?

You are given an undirected graph consisting of n vertices and edges. Instead of giving you the edges that exist in the graph, we give you m unordered pairs (x, y) such that there is no edge between x and y, and if some pair of vertices is not listed in the input, then there is an edge between these vertices.

You have to find the number of connected components in the graph and the size of each component. A connected component is a set of vertices X such that for every two vertices from this set there exists at least one path in the graph connecting these vertices, but adding any other vertex to X violates this rule.

给你一个包含 $n$ 个顶点和 $\frac{n(n-1)}{2} - m$ 条边的无向图。我们并不直接给出图中存在的边，而是给出 $m$ 个无序对 $(x,\,y)$，表示顶点 $x$ 与 $y$ 之间不存在边；而若某对顶点未在输入中列出，则它们之间存在一条边。

你需要求出该图中连通分量的个数，以及每个连通分量的大小。连通分量是指一个顶点集合 $X$，满足：对其中任意两个顶点，图中均存在一条路径将它们连接；但若向 $X$ 中添加任一其他顶点，则上述性质不再成立。

The first line contains two integers n and m (1 ≤ n ≤ 200000, ).

Then m lines follow, each containing a pair of integers x and y (1 ≤ x, y ≤ n, x ≠ y) denoting that there is no edge between x and y. Each pair is listed at most once; (x, y) and (y, x) are considered the same (so they are never listed in the same test). If some pair of vertices is not listed in the input, then there exists an edge between those vertices.

第一行包含两个整数 $n$ 和 $m$（$1 \leq n \leq 200000$，）。

接下来是 $m$ 行，每行包含一对整数 $x$ 和 $y$（$1 \leq x, y \leq n$，$x \neq y$），表示顶点 $x$ 与 $y$ 之间不存在边。每对顶点至多出现一次；$(x, y)$ 与 $(y, x)$ 被视为相同（因此在同一个测试用例中不会同时出现）。若某对顶点未在输入中列出，则它们之间存在一条边。

Firstly print k — the number of connected components in this graph.

Then print k integers — the sizes of components. You should output these integers in non-descending order.

首先输出 k —— 该图中连通分量的个数。

然后输出 k 个整数 —— 各连通分量的大小。你需要按非降序输出这些整数。