hdu 2444 The Accomodation of Students (判断二分图，最大匹配)

The Accomodation of Students
Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8939    Accepted Submission(s): 3925

Problem Description
There are a group of students. Some of them may know each other, while others don't. For example, A and B know each other, B and C know each other. But this may not imply that A and C know each other.

Now you are given all pairs of students who know each other. Your task is to divide the students into two groups so that any two students in the same group don't know each other.If this goal can be achieved, then arrange them into double rooms. Remember, only paris appearing in the previous given set can live in the same room, which means only known students can live in the same room.

Calculate the maximum number of pairs that can be arranged into these double rooms.
 

Input
For each data set:
The first line gives two integers, n and m(1<n<=200), indicating there are n students and m pairs of students who know each other. The next m lines give such pairs.

Proceed to the end of file.

 

Output
If these students cannot be divided into two groups, print "No". Otherwise, print the maximum number of pairs that can be arranged in those rooms.
 

Sample Input
4 4
1 2
1 3
1 4
2 3
6 5
1 2
1 3
1 4
2 5
3 6
 

Sample Output
No
3

C/C++：

 #include <map>
 #include <queue>
 #include <cmath>
 #include <vector>
 #include <string>
 #include <cstdio>
 #include <cstring>
 #include <climits>
 #include <iostream>
 #include <algorithm>
 #define INF 0xffffff
 using namespace std;
 const int my_max = ;

 int nn, mm, n, m, a, b, my_line[my_max][my_max], my_G[my_max][my_max],
     my_left[my_max], my_right[my_max], my_color[my_max], my_book[my_max];

 bool my_dfs(int x)
 {
     for (int i = ; i <= n; ++ i)
     {
         if(my_color[i] ==  && !my_book[i] && my_G[x][i])
         {
             my_book[i] = ;
             if (!my_right[i] || my_dfs(my_right[i]))
             {
                 my_right[i] = x;
                 return true;
             }
         }
     }
     return false;
 }

 bool my_bfs(int x)
 {
     queue <int> Q;
     Q.push(x);
     my_color[x] = ;

     while (!Q.empty())
     {
         int my_now = Q.front();
         for (int i = ; i <= n; ++ i)
         {
             if (my_G[my_now][i])
             {
                 if (my_color[i] == -)
                 {
                     Q.push(i);
                     my_color[i] = !my_color[my_now];
                 }

                 else if (my_color[my_now] == my_color[i])
                     return true;
             }
         }
         Q.pop();
     }

     return false;
 }

 int my_hungarian()
 {
     int my_ans = ;

     for (int i = ; i <= n; ++ i)
     {
         memset(my_book, , sizeof(my_book));
         if (my_color[i] ==  && my_dfs(i))
             my_ans ++;
     }
     return my_ans;
 }

 int main()
 {
     while (~scanf("%d%d", &n, &m))
     {
         memset(my_line, , sizeof(my_line));
         memset(my_right, , sizeof(my_right));
         memset(my_color, -, sizeof(my_color));
         memset(my_G, , sizeof(my_G));

         while (m --)
         {
             scanf("%d%d", &a, &b);
             my_G[a][b] = my_G[b][a] = ;
         }

         bool flag_is_bipG = true;
         for (int i = ; i <= n; ++ i)
             if (my_color[i] == - && my_bfs(i))
             {
                 flag_is_bipG = false;
                 printf("No\n");
                 break;
             }
         if (!flag_is_bipG) continue;

         printf("%d\n", my_hungarian());
     }
     return ;
 }