A bug
Time Limit: 1 Sec Memory Limit: 125 MB
Sescription
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.
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
Sample Output
Scenario #1:
Suspicious bugs found!
Scenario #2:
No suspicious bugs found!
题意:不同性别的昆虫交配为合理,同性交配为不合理。
解法:将同性的昆虫并查集的方法放到一个集合里(例如:1在一个集合里,1+n表示与1相反的性别,放到另一个集合里)
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
#include<queue>
#include<map>
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
map<string,int>mp;
const int Max=3e3+10;
int pre[Max],n,m;
void init()
{
for(int i=0;i<=n;i++)
{
pre[i]=i;
}
}
int Find(int x)
{
if(x==pre[x])
return x;
return pre[x]=Find(pre[x]);
}
void Union(int a,int b)
{
int x=Find(a);
int y=Find(b);
if(x==y)
return ;
else {
pre[y]=x;
}
}
int same(int a,int b)
{
return Find(a)==Find(b);
}
int main()
{
int N,k=0;
scanf("%d",&N);
while(N--)
{
k++;
int a,b;
scanf("%d%d",&n,&m);
init();
int flag=0;
for(int i=0;i<m;i++)
{
scanf("%d%d",&a,&b);
if(flag==1)
continue;
if(same(a,b)) //如果a和b在一个集合里,说明a和b是同性,可疑
{
flag=1;
continue;
}
Union(a,b+n); //将同性合并在一个集合里
Union(b,a+n);
}
printf("Scenario #%d:\n",k);
if(flag==0)
printf("No suspicious bugs found!\n\n");
else printf("Suspicious bugs found!\n\n");
}
return 0;
}