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
alpeshjamgade: 2020-07-29 08:37:12

I did a stupid mistake.......if youre declaring your variable in global namespace please dont forget to clear everything out for each new test case...my code was right from the first submission...did this mistake and got several WA... anyways learnt something important

tarun_28: 2020-07-28 18:01:19

Just implement Bipartite Graph Test

rehank478: 2020-07-27 12:33:55

If taking adjacency list and Color array global then make it empty before taking next input.

pradeep_7: 2020-07-24 04:48:43

Hint :
Cycle + Odd Number

Last edit: 2020-07-24 04:49:12
mayank2120: 2020-07-12 16:49:45

just make sure that you cover all the connected components of the graph

singhsaab_056: 2020-07-09 22:17:55

A simple Bipartite problem

gp409: 2020-07-09 13:45:28

Try this if getting wrong answer:
6 5
1 2
1 3
4 5
5 6
4 6
Scenario #1:
Suspicious bugs found!

tarun003: 2020-07-05 19:51:46

@zank100 no

Nitin: 2020-07-04 22:09:36

Take care of the output format.

cipher135: 2020-07-03 19:02:21

My code is working fine for all the test cases even in the comment section, still getting WA. Here is my solution in C++: https://ideone.com/QgqQLv
Need Help.

Last edit: 2020-07-12 16:26:56

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