Graph-Questions/buglife.cpp at main · subhradeepnag/Graph-Questions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include<bits/stdc++.h>
using namespace std;

map<int,int>visited;
map<int,bool>color;
map<int,list<int>>adj;

void addEdge(int u,int v)
{
    adj[u].push_back(v);
    adj[v].push_back(u);
}

bool dfs(int v,int c)
{
    visited[v] = 1;
    color[v] = c;
    list<int>::iterator it;
    for(it=adj[v].begin();it!=adj[v].end();it++)
    {
        if(visited[*it] == 0)
        {
            bool res = dfs(*it,c^1);
            if(res == false)
            {
                return false;
            }
        }
        else
        {
            if(color[v] == color[*it])
            {
                return false;
            }
        }
    }
    return true;
}

int main()
{
    int t;
    cin>>t;
    int q = 1;
    while(t--)
    {
        int n,m;
        cin>>n>>m;

        for(int i=1;i<=n;i++)
        {
            adj[i].clear();
            visited[i] = 0;
        }
        for(int i=1;i<=m;i++)
        {
            int a,b;
            cin>>a>>b;
            addEdge(a,b);
        }

        bool flag = true;
        for(int i=1;i<=n;i++)
        {
            if(visited[i] == 0)
            {
                bool res = dfs(i,0);

                if(res == false)
                {
                    flag = false;
                }
            }
        }

        cout<<"Scenario #"<<q<<":"<<endl;

        if(flag == false)
        {
            cout<<"Suspicious bugs found!"<<endl;
        }
        else
        {
            cout<<"No suspicious bugs found!"<<endl;
        }
        q++;
    }
}