HDU-1829

来源：互联网发布：java中间件框架编辑：程序博客网时间：2024/04/28 00:51
#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <set>#include <queue>using namespace std;int a[2005][2005];int v[2005];int n,m;queue<int>Q;int ans=0;void BFS(int i){        Q.push(i);        while(!Q.empty()){            int t=Q.front();            Q.pop();            for(int i=0;i<n;i++)            if(a[t][i]==1){                if(v[i]==0){                    v[i]=v[t]*(-1);                    Q.push(i);                }                else if(v[i]==v[t]){                    ans=1;                }            }        }}int main(){    int T;    cin>>T;    int CASE=1;    while(T--){        ans=0;        scanf("%d%d",&n,&m);        int i,j;        int t1,t2;        for(i=0;i<m;i++){            scanf("%d%d",&t1,&t2);            a[t1-1][t2-1]=1;            a[t2-1][t1-1]=1;        }        while(!Q.empty())Q.pop();        for(i=0;i<n&&ans==0;i++){            if(v[i]==0){                v[i]=1;                BFS(i);            }        }        printf("Scenario #%d:\n",CASE++);        if(ans==1)printf("Suspicious bugs found!\n");        else printf("No suspicious bugs found!\n");        cout<<endl;        memset(v,0,sizeof(v));        memset(a,0,sizeof(a));        ans=0;    }    return 0;}
0 0