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
piyushhh: 2016-05-21 09:05:52

I used simple dfs in C. why is it showing TLE??? .

abhilc: 2016-05-04 22:36:35

crap..why the sigabrt!!!!!

gpkgpk: 2016-04-22 13:00:13

4 3
1 4
2 3
3 4
Please refer to previous comment by pretatma.Spoj accepted answer also gives "No suspicious bugs found"

geekyadity: 2016-04-19 12:21:29

Use fast I/O. printf/scanf or ios_base::sync_with_stdio(false)

Riddhi: 2016-04-13 15:54:17

use printf scanf

sarora111: 2016-04-05 20:25:54

Interaction 1 2 means 1->2 & 2->1

killjee_15: 2016-03-22 23:14:18

Please Don't Use spojtoolkit for this question

i_love_coding: 2016-03-21 16:55:43

Got AC after 5 WA's..:(...DO check for every vertex, whether if it is not possible to bi-partite graph or not..:)

newbie: 2016-03-10 05:17:23

got AC in 0.07!! good to see such applications of simple traversal as DFS

try2catch: 2016-02-21 16:40:05

Gays and Lesbians found !!!
used java! Ac in one go . time 0.18 secs.

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 NODEJS PERL 6 VB.net
Resource:2007 PUJ - Circuito de Maratones ACIS / REDIS