[codeforces920E]Connected Components?

最新推荐文章于 2024-08-09 00:47:16 发布

dxyinme

最新推荐文章于 2024-08-09 00:47:16 发布

阅读量180

点赞数

分类专栏： -----------------图论图的遍历 -----------数据结构 set

本文链接：https://blog.csdn.net/dxyinme/article/details/97031640

版权

-----------------图论同时被 3 个专栏收录

78 篇文章 0 订阅

订阅专栏

-----------数据结构

61 篇文章 0 订阅

订阅专栏

图的遍历

20 篇文章 0 订阅

订阅专栏

time limit per test : 2 seconds
memory limit per test : 256 megabytes

分数：2100

You are given an undirected graph consisting of $n$ vertices and ${n(n-1)\over2} -m$ 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 ${{n(n-1)}\over{2}},200000)$ ).

Then m lines follow, each containing a pair of integers $x$ and $y (1 \leq x, y \leq 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

Output

2
1 4

题意：
给定n,m，有一个n个点的图，给定m条边，表示这个图中不存在这条边（没有给出的边都存在）
要求求出这个图有几个联通块和联通块的大小。

题解：
用一个set存当前还未被访问过的点即可，每个点再开一个set存这个点连出去的不存在的边。然后直接正常dfs求联通块大小即可(记得在dfs之前要先从set中删与当前点直接相连的点)。

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,sz;
set<int>tr,a[200004];
void dfs(int x){
    sz++;
    set<int>temp;temp.clear();
    for(int now:tr){
        if(!a[x].count(now)){
            temp.insert(now);
        }
    }
    for(int now:temp)tr.erase(now);
    for(int now:temp)dfs(now);
}
vector<int>ans;

int main(){
    ans.clear();
    tr.clear();
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        tr.insert(i);
        a[i].clear();
    }
    for(int i=1;i<=m;i++){
        int u,v;scanf("%d%d",&u,&v);
        a[u].insert(v);
        a[v].insert(u);
    }
    for(int i=1;i<=n;i++){
        if(tr.count(i)){
            tr.erase(i);
            sz=0;
            dfs(i);
            ans.push_back(sz);
        }
    }
    sort(ans.begin(),ans.end());
    printf("%d\n",ans.size());
    for(int i=0;i<ans.size();i++)printf("%d ",ans[i]);
    puts("");
    return 0;
}