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
Shubham:
2015-06-11 18:37:41
easy one....BFS is sufficient :) |
|
Sourabh :
2015-06-11 12:21:20
During bfs don't presume that the graph is connected. Got a WA for that mistake. |
|
parijat bhatt:
2015-06-10 13:27:03
during bfs i was just trying to toggle the colour everytime. that silly mistake cost me two WA |
|
Ankush :
2015-06-05 08:11:30
Used BFS got WA. :/ AC with DFS |
|
priyank:
2015-06-02 18:48:04
In java use fast input other wise cause tle |
|
CoNtRaDiCtIoN:
2015-05-24 13:53:35
c++ users use scanf, printf , cin cout costs tle |
|
Shubham Bansal:
2015-05-22 19:46:59
just bfs :-)
|
|
Deepak Kumar:
2015-05-21 11:34:20
got it Last edit: 2015-05-22 07:25:31 |
|
Deepak Kumar:
2015-05-21 11:30:47
please give me some hard test cases...
|
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 |