spoj_buglife.cpp

#include <bits/stdc++.h>

#define ll long long

#define ld long double

#define tt(t) read(t); while(t--)

#define endl '\n'

#define vll vector<ll>

#define vvll vector< vll >

#define pll pair<ll ,ll >

#define pss pair < string , string >

#define vpll vector< pll >

#define vpss vector< pss >

#define mp make_pair

#define pb push_back

#define MOD 1000000007

#define inf 1e18;

#define vfind(v,x) (find(all(v),x) != (v).end())

#define clr(c) (c).clear()

#define cres(c,n) (c).clear(),(c).resize(n)

#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

#define all(v) v.begin(),v.end()

#define rall(v) v.rbegin(),v.rend()

#define fst first

#define scd second

#define eb(a) emplace_back(a)

#define ef(a) emplace_front(a)

#define fr(i,n) for(ll (i) = 0 ; (i) < (n) ; ++(i))

#define fr1(i,n) for(ll (i) = 1 ; (i) <= (n) ; ++(i))

#define frr(i,n) for(ll (i) = (n)-1 ; (i)>=0 ; --(i))

#define frab(i,a,b,c) for(ll (i) = a ; (i) <= (b) ; (i)+=(c))



#define mst(A) memset( (A) , 0 , sizeof(A) );


using namespace std;


void write(vll &oneD){

	for(ll i=0;i<oneD.size();i++){

		printf("%lld ",oneD[i]);

	}

	printf("\n");

}

void write(vvll &twoD){

	for(ll i=0;i<twoD.size();i++){

		write(twoD[i]);

	}

}

void write(vpll &oneDP){

	fr(i,oneDP.size()){

		printf("%lld %lld\n" , oneDP[i].fst , oneDP[i].scd);

	}
	cout<<"\n";

}

void write(map< ll , ll > &mpp){

	for(map<ll , ll >::iterator it = mpp.begin() ; it != mpp.end() ; it++){

		cout<<it->fst<<" : "<<it->scd<<endl;

	}

	cout<<endl;

}
bool cmp(const pair<ll,ll> &a,const pair<ll,ll> &b)
{
    if(a.first == b.first)
        return (a.scd >= b.scd);

    return (a.first < b.first);
}


vll seive;
vll primes;

void Seive(){

	const ll maxn = 100005;

	seive.resize(maxn);
	fr(i,maxn) seive[i] = 1;

	//seive[1] = 0;

	//seive[0] = 0;

	for(ll i=2;i*i<maxn;i++)
	{
	     if(seive[i]==1 )
            {
                for(ll j = i*i ; j <maxn ; j+=i)
                {
                         seive[j] = 0;
                }
            }
    }
	primes.pb(2);
	for(ll i=3;i<maxn;i+=2)
    {
        if(seive[i])
            primes.pb(i);
    }
}


ll isprime(ll N){
    if(N<2 || (!(N&1) && N!=2))
        return 0;
    for(ll i=3; i*i<=N; i+=2){
        if(!(N%i))
            return 0;
    }
    return 1;
}


ll power(ll x, ll y , ll m){

    long long int res = 1;

    x = x % m;

    while (y > 0)
    {
        // If y is odd, multiply x with result
        if (y & 1)
            res =(res*x)%MOD;

        // y must be even now
        y = y>>1; // y = y/2
        x = (x*x)%MOD;
    }
    return res;
}


ll modinv(ll x , ll mod = MOD){

	return power(x , mod - 2 , mod);

}
////////////////////////////////////////////////////////////////////////////////

ll visited[20005]={0};
vll color(200005);

ll B[100001];
ll C[100001];
ll D[100001];
vll v[20005];
ll f=0;
ll bfs(ll x)
{
    visited[x]=1;
    queue<ll> Q;
    Q.push(1);

   // color[f].pb(x);
   while(!Q.empty())
    {

        ll p=Q.front();
         //cout<<p<<" ";
        Q.pop();
        for(auto it : v[p])
        {
            if(!visited[it]) {
                Q.push(it);
                //color[!f].pb(it);
                visited[it]=1;

            }
        }
        if(f) f=0;
        else f=1;


    }
}

ll dfs( ll x)
{
    visited[x]=1;

    for(auto it:v[x])
    {
        if(visited[it]==0)
            {

                visited[it]=1;


                color[it]= !color[x];

               if(!dfs(it))
                return 0;

            }
            if(color[it]==color[x]) return 0;
    }
    return 1;
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    #ifndef ONLINE_JUDGE
    freopen("allo.txt","r",stdin);
    #endif
      //  freopen("out.txt","w",stdout);




    ll a,b,c,d;
    ll k,l,m,n,p,q,r,t,x,y;
          p=1;

        cin>>t;while(t--){
                 string s;
        f=0;


        cin>>n>>m;

        fr1(i,n)
        {

        visited[i]=0;
        v[i].clear();
        }

         color.clear();


        fr(i,m)
        {
            cin>>x>>y;
            v[x].pb(y);
            v[y].pb(x);

        }


        fr1(i,n)
        {
            if(visited[i]==0)
            {
                 color[i]=1;
                 f=dfs(i);
                 if(f==0) break;
            }
        }


      cout<<"Scenario #"<<p++<<":\n";

        if(f)
         cout<<"No suspicious bugs found!\n";
         else
         {
             cout<<"Suspicious bugs found!\n";
         }

        }




}






/*

2
8 7
1 2
1 3
2 4
2 5
4 6
6 7
7 8

4 2
1 2
3 4*/