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
apoorva222g: 2020-03-27 14:53:55

A typical bipartite graph problem. Just keep in mind the graph can be disconnected.

aniketakgec: 2020-03-09 20:24:40

can be done using a bipartite graph with 2-coloring solution

aaron2000: 2020-03-06 08:49:46

A better solution would be bfs. Also use 2-coloring.

sa03195100: 2020-02-28 12:15:58

5 <- Số lượng test case
4 4 1 2 <- Test case 1, khu rừng có kích thước 4x4, Hugo đang ở ô (1, 2)
2 1 1 4 1 <- 2 Khu vực bắt đầu cháy ở (1, 1) và (4, 1)
4 1 3 2 1 3 3 3 4 <- 4 Khu vực là hồ ở (1, 3), (2, 1), (3, 3) và (3, 4)
2 2 4 3 4 <- 2 lối thoát ở ô (2, 4) và (3, 4)
0 0 10 20 <- Số lượng kim cương hàng 1
9 3 2 5 <- Số lượng kim cương hàng 2
0 0 0 0 <- Số lượng kim cương hàng 3
0 10 0 100 <- Số lượng kim cương hàng 4
4 4 1 1
1 4 2
2 2 2 3 2
6 4 1 2 1 4 4 1 4 3 1 1 3
0 11 17 7
3 0 9 1
2 6 0 8
0 0 2 0

harshraj22aug: 2020-02-03 17:56:15

WTF !! Solutions like https://ideone.com/<--------snip---no link please-------> getting passed ?? See line 40, not clearing results of previous testcase and still getting passed. Run the following testcases on it, :
4
3 2
1 2
2 3
3 3
1 2
2 3
3 1
5 2
1 2
3 4
4 4
1 2
3 4
3 1
2 4


1
4 4
1 2
3 4
3 1
2 4

This is really pathetic !!!

Last edit: 2020-02-04 07:12:01
sandeep48: 2020-01-28 04:36:17

maintain different array for gender as visited array..applying dfs AC

Last edit: 2020-01-28 09:30:30
bouazza_elaa: 2020-01-17 11:04:52

Um, wtf this is really problematic. Bugs have the right to express their sexual identity however they PLEASE. I'm literally shaking rn

anujrajodiya: 2020-01-11 06:36:59

Take care of the output format!!
costed me 3 WA

hkch: 2020-01-11 02:14:30

For all those who are stuck at problem number 50 and are using bipartite and dfs. Try this test case
1
4 4
1 3
1 4
2 3
2 4
Output:
"No suspicious bugs found!"

ak67373: 2020-01-02 12:10:10

bidirected graph, dfs and put some condition in colouring...


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