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
terminator0309: 2021-06-17 10:17:12

Be ware of the output format, i missed colon in output :( 2WA because of that!

loser_404: 2021-06-05 17:48:15

Similar problem like "Is it a tree" which solved earlier here using bipartite coloring ,lol. Just if a node is not colored at all it still gonna be "no suspicion". Caused 2WA and an hour for that

shandilya21b7: 2021-05-31 11:32:49

PYTHON ! RUNTIME ERROR DUE TO STACKOVERFLOW
can be solved by setting recursionlimit above 2000->
import sys
sys.setrecursionlimit(2100)

kunalsrv20: 2021-05-25 13:06:49

If declaring array globally, do not forget to memset to 0 as there are multitests.

shawkik2003: 2021-04-26 01:26:19

Make sure that you have checked every single connected components

krypton31: 2021-04-15 11:32:03

If you're getting a WA, make sure you've checked for all components of the graph, apparently I missed it two times.

devel18: 2021-02-23 19:04:26

why i am getting a SIGILL ,the sample test case is working correct on my pc, also i have applied bipartite logic correctly
help!

sa03195100: 2021-01-22 13:46:05

1
8 12
1 8 1
1 2 1
1 3 1
2 3 2
2 4 1
2 5 2
2 6 2
3 5 2
4 5 2
5 6 2
5 7 1
6 7 2

tejasreddyk: 2021-01-17 13:51:04

BFS worked out. bipartite is nothing but doing BFS with two colors

tejasreddyk: 2021-01-17 06:58:08

Be aware of the stack overflow, dont use recursion


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