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
Saif :
2016-08-16 21:10:10
In case of wa try this case:
|
|
Ray Brish Bhanu:
2016-08-16 08:58:43
test case is poorly designed...if u take last edge source then u will get ac...incase of very fist node source u will get wrong answer(using bfs)
|
|
sriraj:
2016-08-14 00:03:39
Dont ignore the Scenario #1 cost me a WA
|
|
sshreyaa:
2016-08-05 09:38:42
The output format....be careful else its gonna fuck u hard!!!2 WA's!! |
|
harshgupta007:
2016-08-04 08:21:54
can we implement this using hashset in java |
|
Nikola Zhechev:
2016-07-25 15:27:07
"giving NZEC - runtime error with python while the code is running perfectly fine."
|
|
Tushar Singh:
2016-07-01 23:36:32
Read the comments... used adjacency list... ac in one go!! :D |
|
kshubham02:
2016-06-23 20:45:35
To @admin.
|
|
kshubham02:
2016-06-23 18:01:51
Use scanf/printf.
|
|
aeonflux:
2016-06-16 16:58:24
use printf and scanf ...I got many wa coz of it
|
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 |