链接
http://acm.hdu.edu.cn/showproblem.php?pid=1829
原题
Problem Description
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.
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.
Input
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.
Output
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.
Sample Input
2 3 3 1 2 2 3 1 3 4 2 1 2 3 4
大意就是让你判断有没有同性恋
/*
经典分组并查集
*/
#include <iostream>
using namespace std;
int n,k;
int parent[1000000];
int find(int a)//寻找父亲结点
{
if(a!=parent[a])
return parent[a]=find(parent[a]);
else
return parent[a];
}
void unite(int a,int b)//将a,b连接到同一个父亲节点上
{
a=find(a);
b=find(b);
parent[b]=a;
}
int main()
{
int t,i,x,y,sum=1;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&k);
for(i=1;i<=n*2;i++)
{
parent[i]=i;//初始化,每一个元素自己一个节点
}
int ans=0;
for(i=0;i<k;i++)
{
scanf("%d%d",&x,&y);
if(find(x)==find(y))//找到了,结束
{
ans=1;
}
else
{
unite(x,y+n);将两个数据分到不同的组,并连接到同一个父亲结点
unite(y,x+n);
}
}
printf("Scenario #%d:\n",sum++);
if(ans==1)
printf("Suspicious bugs found!\n");
else
printf("No suspicious bugs found!\n");
printf("\n");
}
return 0;
}
分组并查集经典题。