fork download
  1. #include <iostream>
  2. #include <vector>
  3.  
  4. using namespace std;
  5.  
  6. #define M 1 //masculino
  7. #define F (-1) //femenino
  8. #define U 0 //no marcado
  9. #define PB push_back
  10.  
  11.  
  12. vector<int> adj[21000];
  13. short int g[21000]; //gender
  14.  
  15.  
  16. bool DFS(int r){
  17. bool res = true;
  18. for(int i = 0; i < adj[r].size(); i++){
  19. int v = adj[r][i];
  20. if(g[v] == g[r]){
  21. // cout << v << " " << r << " alfas d\n";
  22. return false;
  23. }
  24. if(g[v] == U){
  25. g[v] = -g[r];
  26. res = res and DFS(v);
  27. }
  28. }
  29. return res;
  30. }
  31.  
  32.  
  33.  
  34. int main(void){
  35.  
  36. int t = 0; cin >> t;
  37. for(int tt = 1; tt <= t; tt++){
  38.  
  39. int n, m; scanf("%d%d",&n,&m);
  40. for(int i = 0; i < n; i++){
  41. g[i] = U;
  42. adj[i].clear();
  43. }
  44.  
  45. int x, y;
  46. for( int i = 0; i < m; i++){
  47.  
  48. scanf("%d%d",&x,&y);
  49. adj[x].PB(y); adj[y].PB(x);
  50. }
  51.  
  52. printf("Scenario #%d:\n",tt);
  53.  
  54. bool result = true;
  55. for(int i = 0; i < n; i++){
  56. if(g[i] == U){
  57. g[i] = M;
  58. result = result and DFS(i);
  59. }
  60. }
  61.  
  62. if(result)
  63. printf("No suspicious bugs found!\n");
  64. else{
  65. printf("Suspicious bugs found!\n");
  66. // for(int i=0;i<n;i++)
  67. // cout << g[i] << ' ';
  68. // cout << '\n';
  69. }
  70. }
  71.  
  72. return 0;
  73. }
  74.  
Success #stdin #stdout 0s 4272KB
stdin
4
3 2
1 2
2 3

3 3
1 2
2 3
3 1

5 2
1 2
3 4

4 4
1 2
3 4
3 1
2 4
stdout
Scenario #1:
No suspicious bugs found!
Scenario #2:
Suspicious bugs found!
Scenario #3:
No suspicious bugs found!
Scenario #4:
Suspicious bugs found!