Va OJ Bicoloring 10004

Va OJ Bicoloring 10004

 

/* The visit judgment after this question is a waste of time. Not optimized .. Later, I came to the Apsara solution report and optimized it in the DFS algorithm.

For (I = 0; I

 

  
*/

  
# Include

   
    
# Include

    
     
Using namespace std; int m [210] [210]; int color [210]; int n; void dfs (int x, int n) {int I; for (I = 0; I

     
      
> N & n) {flag = 0; memset (m, 0, sizeof (m); memset (color, 0, sizeof (color); cin> t; while (t --) {cin> a> B; m [a] [B] = 1; m [B] [a] = 1 ;} for (I = 0; I