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.


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.


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.


3 3
1 2
2 3
1 3
4 2
1 2
3 4

Scenario #1:
Suspicious bugs found!
Scenario #2:
No suspicious bugs found!

hide comments
joker_98: 2017-10-22 09:26:51

union find!! : D

aman22222: 2017-10-21 14:28:38

AC in one go!
Nice problem

vicky_1998: 2017-10-19 10:55:13

Be careful about how to show your output!!!!
Wasted a lot time......I was not printing the ":" and repeatedly getting wrong answer

sy_117: 2017-10-02 21:00:09

Yes, coloring + DFS = Done !!

vishesh197: 2017-09-29 13:34:05

good question.....Just use concept of coloring with bipartite graph and bfs.We use two colours to represent one as male other as female and then just check if parent and child have same colour then non-bipartite graph otherwise
bipartite graph.AC in 2nd go.....0.02s

Last edit: 2017-09-29 13:35:58
burninggoku: 2017-09-22 08:06:17

AC in 3.5 go......

Last edit: 2017-09-22 09:15:44
javier_dlg96: 2017-08-31 03:26:26

Anyone knows how to solve this with a 2-SAT aproach?

jayharsh: 2017-08-22 18:32:20

get AC in 2nd Go change my approach and get the answer ...............DFS is enough...............

Last edit: 2017-08-22 18:38:16
DEVVRAT GUPTA: 2017-08-03 08:07:23

for those who are getting WA
Hint -> Graph may have disconnected components.

prithus2: 2017-07-22 20:43:41

AC in one GO;) Solved like A BOSS!!

Added by:Daniel Gómez Didier
Time limit:0.150s-0.189s
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