[cf920E][set+dfs]

https://codeforc.es/contest/920/problem/E

E. Connected Components?

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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.

Output

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.

Example

input

Copy

5 5
1 2
3 4
3 2
4 2
2 5

output

Copy

2
1 4 
题意：给出一个图的补图，求原图有几个连通块。
题解：用set维护没被访问过的节点，在dfs每一层用vector存储每个与节点相邻的节点，并从set里面删除这些节点，每个节点只会被访问一次，所以复杂度不会太大，尤其注意set删除迭代器位置元素的方法

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e5+5;
#define debug(x) cout<<"["<<#x<<"]"<<x<<endl;
struct edge{
    int fr;
    int to;
    int nex;
}e[maxn<<1];
set<int>st;
int cnt,colo[maxn],head[maxn],col[maxn],coloo[maxn];
void adde(int x,int y){
    e[cnt].fr=x;
    e[cnt].to=y;
    e[cnt].nex=head[x];
    head[x]=cnt++;
}
void dfs(int u,int fa,int c){
    colo[u]=c;
    coloo[c]++;
    for(int i=head[u];i!=-1;i=e[i].nex){
        int v=e[i].to;
        col[v]=u;
    }
    vector<int>g;
    for(auto it=st.begin();it!=st.end();){
        if(col[(*it)]!=u){
            g.push_back((*it));
            st.erase(it++);
        }
        else{
            it++;
        }
    }
    for(int i=0;i<g.size();i++){
        if(!colo[g[i]]){
            dfs(g[i],u,c);
        }
    }
}
int main(){
    int n,m;
    memset(head,-1,sizeof(head));
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)st.insert(i);
    while(m--){
        int a,b;
        scanf("%d%d",&a,&b);
        adde(a,b);
        adde(b,a);
    }
    int ans=0;
    for(int i=1;i<=n;i++){
        if(!colo[i]){
            ans++;
            dfs(i,-1,ans);
        }
    }
    printf("%d
",ans);
    sort(coloo+1,coloo+1+ans);
    for(int i=1;i<=ans;i++){
        printf("%d",coloo[i]);
        char cc=(i==ans)?'
':' ';
        printf("%c",cc);
    }
    return 0;
}

set正确的删除元素的方法

    for(auto it=st.begin();it!=st.end();){
        if(col[(*it)]!=u){
            g.push_back((*it));
            st.erase(it++);
        }
        else{
            it++;
        }
    }

错误的删除方法

    for(auto it=st.begin();it!=st.end();it++){
        if(col[(*it)]!=u){
            g.push_back((*it));
            st.erase(it);
        }
    }