HDU1829 POJ2492 A Bug's Life

A Bug's Life

Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 14060    Accepted Submission(s): 4578

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.

 

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

23 31 22 31 34 21 23 4

 

Sample Output

Scenario #1:Suspicious bugs found!Scenario #2:No suspicious bugs found!
Hint
Huge input,scanf is recommended.
 

Source

TUD Programming Contest 2005, Darmstadt, Germany 

http://acm.split.hdu.edu.cn/showproblem.php?pid=1829

题意 就是判断有没有搞基的  2组样例 3个人 3对关系

第一组样例 1 2为异性 2 3为异性 1 3又为异性 就有矛盾了

有二中方法做(我知道的) 搜索  并查集

http://blog.csdn.net/u011394362/article/details/20037747

别人的链接 讲得肯定更清楚