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
arpit: 2015-07-07 13:35:55

hmm BFS ...AC

Vishal: 2015-06-28 19:26:56

Last edit: 2015-06-28 19:28:10
root8950: 2015-06-28 16:50:09

was printing
No Suspicious bugs found!

who cares: 2015-06-25 10:49:36

HMM BFS I LIKE YOU =D =D
DFS still wants to know about your depth :(

Yash: 2015-06-24 08:44:26

My first graph problem! Feeling good :)
Studied geeksforgeek article on bipartite graph and then incorporated that concept for this question.
After little struggle, finally green light!

sourabh: 2015-06-18 11:56:11

sort of graph coloring with 2 colors

Shubham: 2015-06-11 18:37:41

easy one....BFS is sufficient :)

Sourabh : 2015-06-11 12:21:20

During bfs don't presume that the graph is connected. Got a WA for that mistake.

parijat bhatt: 2015-06-10 13:27:03

during bfs i was just trying to toggle the colour everytime. that silly mistake cost me two WA

Ankush : 2015-06-05 08:11:30

Used BFS got WA. :/ AC with DFS


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