You are given an undirected graph consisting of nn vertices and mm edges. Your task is to find the number of connected components which are cycles.
Here are some definitions of graph theory.
An undirected graph consists of two sets: set of nodes (called vertices) and set of edges. Each edge connects a pair of vertices. All edges are bidirectional (i.e. if a vertex aa is connected with a vertex bb, a vertex bb is also connected with a vertex aa). An edge can't connect vertex with itself, there is at most one edge between a pair of vertices.
Two vertices uu and vv belong to the same connected component if and only if there is at least one path along edges connecting uu and vv.
A connected component is a cycle if and only if its vertices can be reordered in such a way that:
- the first vertex is connected with the second vertex by an edge,
- the second vertex is connected with the third vertex by an edge,
- ...
- the last vertex is connected with the first vertex by an edge,
- all the described edges of a cycle are distinct.
A cycle doesn't contain any other edges except described above. By definition any cycle contains three or more vertices.
![](https://i-blog.csdnimg.cn/blog_migrate/cc882a4a20428391902fb03b020b7880.png)
The first line contains two integer numbers nn and mm (1≤n≤2⋅1051≤n≤2⋅105, 0≤m≤2⋅1050≤m≤2⋅105) — number of vertices and edges.
The following mm lines contains edges: edge ii is given as a pair of vertices vivi, uiui (1≤vi,ui≤n1≤vi,ui≤n, ui≠viui≠vi). There is no multiple edges in the given graph, i.e. for each pair (vi,uivi,ui) there no other pairs (vi,uivi,ui) and (ui,viui,vi) in the list of edges.
Print one integer — the number of connected components which are also cycles.
5 4 1 2 3 4 5 4 3 5
1
17 15 1 8 1 12 5 11 11 9 9 15 15 5 4 13 3 13 4 3 10 16 7 10 16 7 14 3 14 4 17 6
2
In the first example only component [3,4,5][3,4,5] is also a cycle.
The illustration above corresponds to the second example.
题意:给出n个数字和m个连接,求单环数量。(单环:每个节点仅仅与其他2个节点相连,且没有散枝)
思路:
1.DFS暴力搜索+标记
#include <bits/stdc++.h>
using namespace std;
int vis[200005];
int flag;
vector<int>a[200005];
void DFS(int x) //将所有与x相连的标记 判断是否成为单环
{
vis[x]=1;
if(a[x].size()!=2)
flag=1;
for(int j=0;j<a[x].size();j++){
int i=a[x][j];
if(!vis[i])
DFS(i);
}
}
int main()
{
int n,m;
cin>>n>>m;
int x,y;
memset(vis,0,sizeof(vis));
for(int i=1;i<=m;i++){
cin>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
int ans=0;
for(int i=1;i<=n;i++){
flag=0;
if(!vis[i]){
DFS(i);
if(!flag)
ans++;
}
}
cout<<ans<<endl;
}
2.并查集 因为最后构成的是一个环,所以一个环中存在一次前驱相同的时候(即为构成圆环的时候).
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5+5;
int n,m,cnt;
int x[N],parent[N];
struct node
{
int u,v;
} a[N];
int find(int x)
{
return x==parent[x]?x:find(parent[x]);
}
void make(int x,int y)
{
int fx=find(x);
int fy=find(y);
if(fx==fy) cnt++;
else
parent[fx]=fy;
}
int main()
{
int n,m;
cin>>n>>m;
memset(x, 0, sizeof(x));
for (int i = 1; i <= n; i++)
parent[i] = i;
for(int i=1; i<=m; i++)
{
cin>>a[i].u>>a[i].v;
if(a[i].v==a[i].u) continue;
x[a[i].u]++;
x[a[i].v]++;
}
cnt=0;
for(int i=1; i<=m; i++)
{
if(x[a[i].u]==2&&x[a[i].v]==2)
make(a[i].u,a[i].v);
}
cout<<cnt<<endl;
}