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
cipher135: 2020-07-03 19:02:21

Why should I care about disconnected component? My code is working fine for all the test cases in the comment section, still getting WA. Need Help.

kumar_anubhav: 2020-07-01 20:54:33

Learned Bipartite Graph !!

karthikeyahs: 2020-07-01 14:06:29

Good problem on Bipartite graph

chandanag23: 2020-06-26 14:40:32

AC in one go :)

manunem: 2020-06-15 06:21:12

Basically you have to check if the graph is bipartite or not for all components of the graph.A graph may have more than one connected component.So if you miss that you will get a WA

lovlesh_007: 2020-06-10 01:18:50

Simple Logic, check given graph is bipartite or not .

Last edit: 2020-06-11 11:40:54
karlo_2107: 2020-06-07 19:04:36

Is anybody know why I got WA?

coolboy7: 2020-06-06 20:15:54

if there are even number of nodes in cycle, then it satisfies the assumption

zank100: 2020-06-04 00:52:55

If a bug has no relations with any other bug , is it a suspicious bug?

this_variable: 2020-05-27 19:56:03

Should have considered graph to be undirected...got a WA for that else bipartitie and check for all unvisited nodes


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