BUGLIFE - A Bug’s Life.cpp

#include<bits/stdc++.h>
using namespace std;

vector<int>v[2005];
bool visited[2005];
int c[2005];
int n,e;
int flag;

void dfs(int x){

    visited[x]=true;
    for(int i=0;i<v[x].size();i++){
        int xx = v[x][i];
        if(c[xx]==c[x]){
            flag=1;
            return;
        }
        if(visited[xx]==true) continue;
        if(c[x]=='m') c[xx]='w';
        else c[xx]='m';
        dfs(xx);
    }

}

int main(){

    int t;
    scanf("%d",&t);
    for(int i=1;i<=t;i++){
        int a,b;
        scanf("%d %d",&n,&e);

        memset(c,'a',sizeof(c));
        int p;
        while(e--){
            scanf("%d %d",&a,&b);
             v[a].push_back(b);
             v[b].push_back(a);
             p=a;
        }

        flag=0;
        for(int j=1;j<=n;j++){
            if(visited[j]==false && flag==0) {
                if(c[j]!='w')c[j]='m';
                //cout<<"dfs "<<j<<" ";
                dfs(j);
            }
        }

        printf("Scenario #%d:\n",i);
        if(flag==0) printf("No suspicious bugs found!\n");
        else printf("Suspicious bugs found!\n");

        for(int j=1;j<=n;j++){
            v[j].clear();
        }

        memset(visited,false,sizeof(visited));


    }


}