zoj Circle 并查集+出入度检测

Description

Your task is so easy. I will give you an undirected graph, and you just need to tell me whether the graph is just a circle. A cycle is three or more nodes V₁, V₂, V₃, ... V_k, such that there are edges between V₁ and V₂, V₂ and V₃, ... V_k and V₁, with no other extra edges. The graph will not contain self-loop. Furthermore, there is at most one edge between two nodes.

Input

There are multiple cases (no more than 10).

The first line contains two integers n and m, which indicate the number of nodes and the number of edges (1 < n < 10, 1 <= m < 20).

Following are m lines, each contains two integers x and y (1 <= x, y <= n, x != y), which means there is an edge between node x and node y.

There is a blank line between cases.

Output

If the graph is just a circle, output "YES", otherwise output "NO"

我们可以知道，若n个点构成一个圆，只有一条回路，自己与自己不能构成回路，所以如果能够成一个圆，那每个节点的出入度都是二并且，查找每个点，其f[x]都是n。。。

附上代码 备忘

#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
int f[20];
int cnt[20],cir[20];
int n,m,a,b;
int find(int x)
{
 if(f[x]!=x)
     f[x]=find(f[x]);
 return f[x];
}
void make(int a,int b)
{
  int f1=find(a);
  int f2=find(b);
  if(f2!=f1)
  {
    cnt[f1]+=cnt[f2];
    f[f2]=f1;  
  }
}
int main()
{
 while(cin>>n>>m)
 {
   int flag=0;
   memset(cir,0,sizeof(cir));
   for(int i=1;i<=n;i++)
   {
      f[i]=i;
      cnt[i]=1; 
   }
   for(int i=0;i<m;i++)
   {
     cin>>a>>b;
         if(a==b)
         {
           flag=1;
           break;   
         }
     cir[a]++;
     cir[b]++;
     make(a,b);   
     
   }
  if(flag)
   {
    printf("NO\n");
    continue;
   }
  for(int i=1;i<=n;i++)
  {
     int t=find(i);
     if(cnt[t]!=n||cir[i]!=2)
     {
        flag=1;
        break; 
     }
  }
  if(flag)
    printf("NO\n");
  else
    printf("YES\n");
 
 }
 
 return 0;   
}