求补图连通块总数及每一块大小（CF920E Connected Components?）

CF920E Connected Components?

#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <queue>
#include <deque>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <bitset>
#include <set>
#include <map>
#define inf 0x7fffffff
#define ll long long
//#define int long long
//#define double long double
#define eps 1e-5
//#define mod 1e9+7
using namespace std;
const int mod=10007;
const int M=2*1e2+5;
const int N=2*1e6+5;//空间最大限制 4e8
int n,m;;
struct node
{
	int ver,next;
}e[N];
int tot,head[N];
int ne[N],pre[N];
int cnt,sum,ans,ret;
int a[N],c[N];
void add(int x,int y)
{
	e[++tot].ver=y;
	e[tot].next=head[x];
	head[x]=tot;
}
void bfs()
{
	while(ne[0]!=n+1)
	{
		int sum=1;
		queue < int > q;
		q.push(ne[0]);
		ne[0]=ne[ne[0]];
		pre[ne[0]]=0;
		while(!q.empty())
		{
			ret++;
			int x=q.front();
			q.pop();
			for(int i=head[x];i;i=e[i].next)
			{
				int y=e[i].ver;
				c[y]=ret;
			}
			for(int i=ne[0];i!=n+1;i=ne[i])  if(c[i]!=ret)  ne[pre[i]]=ne[i],pre[ne[i]]=pre[i],q.push(i),sum++;
		}
		a[++cnt]=sum;
	}
}
signed main()
{
//	ios::sync_with_stdio(false);
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		add(x,y);
		add(y,x);
	}
	for(int i=1;i<=n;i++)  pre[i]=i-1,ne[i]=i+1;
	pre[n+1]=n,ne[0]=1;
	bfs();
//	int ss=0;
//	for(int i=1;i<=cnt;i++)  ss+=a[i]/2;
//	cout<<ss;
	sort(a+1,a+cnt+1);
	cout<<cnt<<endl;
	for(int i=1;i<=cnt;i++)  printf("%d ",a[i]);
    return 0;
}