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
Nikola Zhechev: 2016-07-25 15:27:07

"giving NZEC - runtime error with python while the code is running perfectly fine."
Probably stack overflow error. Try to test with some extreme case - very deep tree for example (1 2, 2 3, 3 4, ... up to 1999 2000)

Tushar Singh: 2016-07-01 23:36:32

Read the comments... used adjacency list... ac in one go!! :D

kshubham02: 2016-06-23 20:45:35

To @admin.
There is a test case in the toolkit (one with 1000 bugs and 999 interactions), for which my (AC) code outputs "No suspicious bugs found". The toolkit however outputs "Suspicious bugs found".
Please look into it.

kshubham02: 2016-06-23 18:01:51

Use scanf/printf.
cin/cout gives TLE.

avisheksanvas: 2016-06-21 06:35:00

Its "No suspicious bugs found" and not "No Suspicious bugs found". Cost me 4 WA's !

aeonflux: 2016-06-16 16:58:24

use printf and scanf ...I got many wa coz of it

exceptions28: 2016-06-15 04:45:02

as simple As cup of tea

rishi_devan: 2016-06-07 20:18:53

Check if Bipartite graph

Last edit: 2016-06-09 19:58:50
bhavik29: 2016-06-07 10:43:22

giving NZEC - runtime error with python while the code is running perfectly fine.

lt: 2016-06-02 12:40:26

Wrong spelling of suspicious caused 1WA. Finally AC :)


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 NODEJS PERL 6 VB.net
Resource:2007 PUJ - Circuito de Maratones ACIS / REDIS