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
carofe82: 2018-02-17 07:06:27

My solution in Java was correct: a simple graph coloring problem with two colors. However, it was TLE. I had to use the highly optimized Input Reader from here: https://github.com/lewin/SPOJ/blob/master/buglife.java to be able to get my solution accepted.

Last edit: 2018-02-17 07:07:31
ramini1996: 2018-02-03 15:13:59

Graph may be disconnected

*** Spoiler Alert ***

Just check if there is a cycle with odd number of edges

vss1996: 2018-02-02 19:40:37

I did union find but gave wa. Can someone help out ?

aniket000: 2018-01-30 14:54:59

just bfs is enough , but the graph may be disconnected

abhinav_thakur: 2018-01-27 08:39:40

BFS is enough...AC in one go :)

bani_raheja: 2018-01-04 11:08:00

Be careful with the output format. Costed me WAs more than u can imagine :/

atiq: 2017-12-24 03:21:22

Folks, if you are getting TLE for C# or Java please try adjacency matrix than adjacency list. I guess judge input has large number of edges for some vertices so adjacency list iteration can cost a lot.

diptark_bose: 2017-12-22 09:12:22

Getting TLE in java for both disjoint sets and coloring approaches!!

spandana09: 2017-12-15 11:49:08

has to be a bipartite graph (Hint: coloring )
ps: be very careful with the output format.

joker_98: 2017-10-22 09:26:51

union find!! : D


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