题解A Bug‘s Life(种类合并）

Background
Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender. In his experiment, individual bugs and their interactions were easy to identify, because numbers were printed on their backs.
Problem
Given a list of bug interactions, decide whether the experiment supports his assumption of two genders with no homosexual bugs or if it contains some bug interactions that falsify it.

输入：

The first line of the input contains the number of scenarios. Each scenario starts with one line giving the number of bugs (at least one, and up to 2000) and the number of interactions (up to 1000000) separated by a single space. In the following lines, each interaction is given in the form of two distinct bug numbers separated by a single space. Bugs are numbered consecutively starting from one.

输出： 

The output for every scenario is a line containing "Scenario #i:", where i is the number of the scenario starting at 1, followed by one line saying either "No suspicious bugs found!" if the experiment is consistent with his assumption about the bugs' sexual behavior, or "Suspicious bugs found!" if Professor Hopper's assumption is definitely wrong.

 输入测试样例：

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

输出测试样例 

Scenario #1:
Suspicious bugs found!

Scenario #2:
No suspicious bugs found!

题目的意思是输入测试样例的数量，每组测试样例包括n，m。n为虫子的数量编号从1-n；m为虫子的交配次数，接下来输入m次交配行为，每次交配行为包括两个虫子，输出是否存在矛盾使得这些虫子中有同性恋。

这是一个并查集问题，将两个性别作为两个集合，如果有一次交配行为中的两个虫子同一性别，即在同一集合中，则存在同性恋。

#include<iostream>
#include<string.h>
#include<algorithm>
const int N=10010;
int n,m,k,t,ans=0,a,b;
int p[N],ch[N];//ch[i]代表的是昆虫i上一次的交配对象 
using namespace std;
int find(int x)
{
	if(p[x]!=x)
	p[x]=find(p[x]);
	return p[x];
 } 
int main()
{
	scanf("%d",&t);
	while(t--)
	{
		memset(ch,0,sizeof(ch));
		int flag=0;
		scanf("%d %d",&n,&m);
		for(int i=0;i<=n;i++)
	    p[i]=i;
		while(m--)
		{
			scanf("%d %d",&a,&b);
			if(find(a)==find(b))//查询a,b是否在同一集合。 
			{
				flag=1;
			}
			else
			{
				if(ch[a])//如果a有对象，则让b合并到a的对象的集合中 
				p[find(ch[a])]=find(b)
		        if(ch[b])
		        p[find(ch[b])]=find(a);
		        ch[a]=b;//更新对象 
		        ch[b]=a;
			}
		}
		    if(flag)
			printf("Scenario #%d:\nSuspicious bugs found!\n\n",++ans);
			else
			printf("Scenario #%d:\nNo suspicious bugs found!\n\n",++ans);
	}
	return 0;
}