2492 A Bug's Life

最新推荐文章于 2024-06-23 09:17:33 发布

原创最新推荐文章于 2024-06-23 09:17:33 发布 · 547 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#bugs #numbers #behavior #input #each #output

acm_并查集专栏收录该内容

16 篇文章

订阅专栏

A Bug's Life

Time Limit: 10000MS		Memory Limit: 65536K
Total Submissions: 13782		Accepted: 4423

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.

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

Sample Output

Scenario #1:
Suspicious bugs found!

Scenario #2:
No suspicious bugs found!

Hint

Huge input,scanf is recommended.

#include<iostream>
using namespace std;
int fath[2005],rank[2005],opp[2005];
int find(int x)
{
return fath[x]==x?x:fath[x]=find(fath[x]);
}
void uion(int x,int y)
{
x=find(x);
y=find(y);
if(x==y) return ;
if(rank[x]>rank[y])
{
  fath[y]=x;
}
else
{
  fath[x]=y;
  if(rank[x]==rank[y]) rank[y]++;
}
}
int main()
{
int cci;cin>> cci;
for(int ci=1;ci<=cci;ci++)
{
  int n,m;
  cin>>n>>m;
  int i;
  for(i=1;i<=n;i++) fath[i]=i,rank[i]=0,opp[i]=i;
  int flag=0;
  while(m--)
  {
   int x,y;
   cin>>x>>y;
   if(find(x)==find(y)) flag=1;
   if(opp[x]==x) opp[x]=y;
   else uion(opp[x],y);
   if(opp[y]==y) opp[y]=x;
   else uion(opp[y],x);
  }
  printf("Scenario #%d:/n",ci);
  if(flag) cout<<"Suspicious bugs found!/n"<<endl;
  else cout<<"No suspicious bugs found!/n"<<endl;
}
return 0;
}