A Bugs Life | Editorial by modi

A Bugs Life | Editorial by modi_nitin13

1. Simply use BFS to solve the problem.
2. Make a adjacency list.
3. The question is basically a  Bipartite question.
4. That's All.
5. LIKE THE EDITORIAL IF YOU FIND IT GOOD.
6. Here's the code attached for reference.
7.**NOTE-**Disconnected Graphs may be there.

```
#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
#define pb push_back
int main()
{
ll t,i,j,s,x,y,n,m,k;
cin>>t;
for(j=0;j<t;j++)
{
    cin>>n>>m;
    vector<bool> gender(n,false);
    vector<bool> gc(n,false);
    vector<ll> adj[n];
    for(i=0;i<m;i++)
    {
        cin>>x>>y;
        adj[x-1].pb(y-1);
        adj[y-1].pb(x-1);
    }
    bool f=true;
    for(k=0;k<n;k++)
    {
    if(gc[k]==false)
    {
    queue<ll> q;
    s=k;
    q.push(s);
    gc[s]=true;
    gender[s]=false;
    while(!q.empty())
    {
     s=q.front();
     q.pop();
     for(i=0;i<adj[s].size();i++)
     {
      if(gc[adj[s][i]]==false)
      {gender[adj[s][i]]=!gender[s];gc[adj[s][i]]=true;q.push(adj[s][i]);}
      else
      {
          if(gender[adj[s][i]]==gender[s])
          {f=false;goto last;}
      }
     }
    }
    }
    }
    last:
    ;
    if(f==false)
    {
     cout<<"Scenario #"<<j+1<<":"<<endl;
     cout<<"Suspicious bugs found!"<<endl;
    }
    else
    {
     cout<<"Scenario #"<<j+1<<":"<<endl;
     cout<<"No suspicious bugs found!"<<endl;
    }
}
}

```

A Bugs Life | Editorial by modi_nitin13

Download submission

All caught up!

View submission

Is your resume even shortlisted?