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
sayanchaudhuri: 2020-05-20 07:20:53

I don't get it.Why i should be beware of disconnected components?the solution is possible as long as there is no cycle in the graph.So we just check for cycles in each connected component..

avsd_47: 2020-05-03 10:28:02

I don't know why it happened like that with c++ but in my case i was getting continuos WA....then i casually changed my array delaration as colour[vertices] = {0} which has initialization included in it ..to colour[vertices] and then a for loop for initialization colour[i]=0 and submitted solution which got accepted . Be careful with initialization in c++

Last edit: 2020-05-03 10:28:59
abhishek55236: 2020-04-26 06:54:22


artur_ionco: 2020-04-24 03:15:56

Sorry but i can´t find my mistake in my test it´s ok, but when i submit it i get a wrong answer link:https://ideone.com/DCAfaC pls tell me if you find it

samio: 2020-04-20 17:28:53

2 coloring / bfs / bipartite graph test / connected components

Last edit: 2020-04-20 17:30:32
code_typer: 2020-04-20 10:08:54

Beware of disconnected graph. It might not visit vertexes!
It cost me 11th WA.

gauravbhag51: 2020-04-19 20:29:03

one shot submission.....good problem....

nikita_omare98: 2020-04-16 17:25:27

simple just check for bipartite and beware of disconnected graph

Last edit: 2020-04-16 17:26:10
samkh50: 2020-04-14 21:13:29

AC in 2nd go , I forgot to check case of disconnected graphs :P

pratyaydeep: 2020-04-13 23:38:04

AC in 3 go, I forgot to check all the Connected Components :-)

Added by:Daniel Gómez Didier
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