bug life

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

vector<int>adj[2005];
int visited[2005];
int gen[2005];
int q = 2;
int s ;
void dfs(int n)
{
    if(visited[n]==1)
        return;
    visited[n]=1;
    if(q == 1)
    {
        gen[n]=2;
        q = 2;
    }
    else
    {
        gen[n]=1;
        q = 1;
    }
    for(int i=0; i<adj[n].size(); i++)
    {
        dfs(adj[n][i]);
        if(gen[n]==gen[adj[n][i]])
            s = 1;
    }
}
int main()
{
    int t,k;
    cin>>t;
    for(k=1; k<=t; k++)
    {

        int n,m,i,j,u,v;
        cin>>n>>m;
        for(i=1; i<=n; i++)
        {
            visited[i]=0;
            gen[i]=0;
            adj[i].clear();
        }
        q = 2;
        s = 0;
        for(i=0; i<m; i++)
        {
            cin>>u>>v;
            adj[u].push_back(v);
            adj[v].push_back(u);
        }
        dfs(1);
        printf("Scenario #%d:\n",k);
        if(s==1)
            printf("Suspicious bugs found!\n");
        else
            printf("No suspicious bugs found!\n");
    }

    return 0;
}