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
ankush: 2017-01-27 10:36:26

just colour the graph !! :)

arpit_1996: 2017-01-26 12:35:43

I have checked everything but getting SIGSEGV . :( What maybe the reason??

manya_cod4: 2017-01-24 05:23:49

I have done a bfs . but still my answer is coming wrong. any case that i m trying its working. but when i m submitting. its coming wrong. please help

haogram: 2017-01-10 02:27:31

Just a graph colorer.

esshuvo: 2017-01-04 19:49:46

bfs,BUT REMEMBER this is not a connected graph :)

sri: 2016-11-16 19:24:01

Nice Question!!!
if wa try this
1
6 5
1 2
3 4
4 5
5 6
3 5
answer should be suspicious bugs found!

tungtd95: 2016-11-16 09:17:08

C++ AC in one go. 0.13s without library.

Anirban Acharya: 2016-10-12 15:32:22

Go ahead.. ;) color your graph.

Last edit: 2016-10-12 15:34:10
marshmellow: 2016-10-12 09:32:01

graph may not be connected..

davidgalehouse: 2016-10-02 09:02:13

For C# had to strip everything down and have vertices store their own search state but the biggest part was using a List instead of a HashSet to store neighbors (not making use of the HashSet functionality for this problem, and even if removing it leads to creating a multigraph (a pair of ants going on more than one date), doesn't matter). I observed no time difference when swapping search start position from first to last vertex. TLE when using BFS instead of DFS. But my same solution gets AC and TLE across different submits so you should probably figure out how those faster people did it.

Last edit: 2016-10-02 20:07:16

Added by:Daniel Gómez Didier
Date:2008-11-17
Time limit:1s-5s
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