BUGLIFE - A Bug’s Life


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.

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.

Example

Input:
2
3 3
1 2
2 3
1 3
4 2
1 2
3 4

Output:
Scenario #1:
Suspicious bugs found!
Scenario #2:
No suspicious bugs found!

hide comments
deepak097: 2018-08-09 20:38:47

AC in 5th Go :( [ 0.04 sec ] :P used a distance arrray to solve this problem.

joqsan_77: 2018-08-04 19:20:08

"Bugs are numbered consecutively starting from one."

In spojtoolkit there are test cases where this is violated.

jvjplus: 2018-07-23 08:24:35

Be Careful, there can be disconnected graph also!

markomafko972: 2018-07-19 17:44:18

Try CLCKBAIT after this!

s_a_k_s_h_a_m: 2018-07-16 22:28:08

anyone with the union find technique?
help me out

vaishcr7: 2018-07-08 18:28:09

If you are getting TLE in java ....Don't use String Tokenizer........use byte array for fast input output...........
if getting wa ,dont forget to check colon .. i was helped by these comments too :)

cyber_sm0ke: 2018-06-28 19:36:51

Can You send Me solution using Bipartite coloring . plz

Email : shivi98g@gmail.com

rajcoolaryan: 2018-06-24 06:27:01

output format costed 2 wa

bu1th4nh: 2018-06-20 06:06:51

AC after many attempt :(. Just because of a colon punctuation and a correct algo

dikshit_30: 2018-06-17 21:59:11

Finally AC on the third attempt. The graph may have disconnected components.
Logic: Revolves around checking if bipartite exists or not.


Added by:Daniel Gómez Didier
Date:2008-11-17
Time limit:0.150s-0.189s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:2007 PUJ - Circuito de Maratones ACIS / REDIS