畅通工程
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 64641 Accepted Submission(s): 34587
注意:两个城市之间可以有多条道路相通,也就是说
3 3
1 2
1 2
2 1
这种输入也是合法的
当N为0时,输入结束,该用例不被处理。
#include<stdio.h>
const int MAXN=1010;
int F[MAXN];
int find(int t)
{
if(F[t]!=t)
{
F[t]=find(F[t]);
}
return F[t];
}
void mix(int a,int b)
{
int t1=find(a);
int t2=find(b);
if(t1!=t2) F[t1]=t2;
}
int main()
{
int n,m;
while(scanf("%d",&n),n)
{
scanf("%d",&m);
for(int i=1;i<=n;i++) F[i]=i;
int a,b;
while(m--)
{
scanf("%d%d",&a,&b);
mix(a,b);
}
int res=0;
for(int i=1;i<=n;i++)
if(F[i]==i) res++;
printf("%d\n",res-1);///n个点需要n-1条路
}
return 0;
}
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.
AC代码:
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <stack>
#include <queue>
using namespace std;///找出有多少个环
#define ll long long///算出每个顶点的度,只有度等于2的情况下才能成为环。如果两个顶点的度都为2,使用并查集,如果父节点相同,答案加一,否则联立。
int f[200010];
int sum[200010];
int ans;
struct edge
{
int u,v;
};
int find(int x)///find()朴素递归算法
{
if(f[x] != x)
{
f[x] = find(f[x]);
}
return f[x];
}
void unio(int x,int y)
{
int f1 = find(x);
int f2 = find(y);
//cout<<"f("<<x<<")"<<"="<<f[x]<<" "<<"f("<<y<<")"<<"="<<f[y]<<endl;
if(f1 != f2)
f[f1] = f2;
else
ans++;
}
int main()
{
int n,m;
while(cin >> n >> m)
{
memset(sum,0,sizeof(sum));
for(int i = 1;i <= n;i++)
f[i] = i;
ans = 0;
struct edge e[m];
for(int i = 0;i < m;i++)
{
cin >> e[i].u >> e[i].v;
sum[e[i].u]++;
sum[e[i].v]++;
}
for(int i = 0;i < m;i++)
{
if(sum[e[i].u] == 2 && sum[e[i].v] == 2)///如果度为2就和并,最好头尾相连的时候可以判断是否ans+1
unio(e[i].u,e[i].v);
}
cout << ans <<endl;
}
return 0;
}
hdu1272:
小希的迷宫
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 60597 Accepted Submission(s): 19036
![](https://i-blog.csdnimg.cn/blog_migrate/ce3d27d9f95d7ac87d47240232e2e0ba.jpeg)
整个文件以两个-1结尾。
代码:
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int vis[102400];
int f[102400],flag;
int find(int x)
{
if(f[x]!=x)
f[x]=find(f[x]);
return f[x];
}
void mix(int a,int b)
{
int fx=find(a),fy=find(b);
if(fx!=fy)
f[fx]=fy;
else flag=1;///如果fx==fy,则这两个点有共同祖先,成环!
}
int main()
{
int n,m,k=0,Max=1;
for(int i=1;i<=100001;i++)
f[i]=i;
while(scanf("%d%d",&n,&m)&&n!=-1||m!=-1)
{
if(n==0&&m==0)
{
for(int i=1;i<=Max;i++)///判断所有的边是否连在一起
{
if(vis[i]&&f[i]==i)
k++;
}
if(k>1)flag=1;
if(!flag)printf("Yes\n");
else printf("No\n");
memset(vis,0,sizeof(vis));
for(int i=1;i<=Max;i++)
f[i]=i;
flag=0;
k=0;
}
else{
Max=max(Max,max(n,m));
mix(n,m);
vis[n]=vis[m]=1; ///标记
}
}
return 0;
}