poj2492 A bug's life{種類並查集}

A Bug's Life

Time Limit: 10000MS		Memory Limit: 65536K
Total Submissions: 25605		Accepted: 8334

Description

Background 
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. 
Problem 
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.

Sample Input

2
3 3
1 2
2 3
1 3
4 2
1 2
3 4

Sample Output

Scenario #1:
Suspicious bugs found!

Scenario #2:
No suspicious bugs found!

var

  t,n,m,k,x,y:longint;

  flag:boolean;

  f:array[1..2000] of longint;

  diff:array[1..2000] of longint;

function findset(x:longint):longint;

begin

  if x<>f[x] then

    f[x]:=findset(f[x]);

  exit(f[x]);

end;

procedure union(x,y:longint);

var

 fx,fy:longint;

begin

  fx:=findset(x);

  fy:=findset(y);

  f[fx]:=fy;

end;

procedure main;

var

  i:longint;

begin

  fillchar(f,sizeof(f),0);

  fillchar(diff,sizeof(diff),0);

  flag:=true;

  read(n,m);

  for i:=1 to n do

    f[i]:=i;

  i:=1;

  while i<=m do

    begin

      read(x,y);

      if flag then

        begin

          if findset(x)=findset(y) then

            begin

              writeln('Scenario #',k,':');

              writeln('Suspicious bugs found!');

              writeln;

              flag:=false;

            end

          else

            begin

              if diff[x]=0 then diff[x]:=y;

              if diff[y]=0 then diff[y]:=x;

              union(diff[x],y);

              union(diff[y],x);

            end;

        end;

      inc(i);

    end;

  if flag then

    begin

      writeln('Scenario #',k,':');

      writeln('No suspicious bugs found!');

      writeln;

    end;

end;

begin

  readln(t);

  for k:=1 to t do main;

end.