HDU1507 Uncle Tom's Inherited Land*

题目是跟 zoj1516是一样的，但多了匹配后的输出

详解zoj1516可见http://www.cnblogs.com/CSU3901130321/p/4228057.html

 #include <cstdio>
 #include <cstring>
 #include <cmath>
 using namespace std;

 const int maxn = ;
 int n , m , k;
 int g[maxn][maxn] , cx[maxn] , cy[maxn] , visy[maxn] , nx , ny;
 bool col[][];//判断是否为鱼塘

 struct Point{
     int x , y;
     Point(int x= , int y=):x(x),y(y){}
 };

 Point px[maxn] , py[maxn];

 bool ok(Point p1 , Point p2)
 {
     if((p1.x == p2.x && abs(p1.y - p2.y) == ) || (p1.y == p2.y && abs(p1.x - p2.x) == ))
         return true;
     return false;
 }

 void build_graph()
 {
     memset(g ,  , sizeof(g));
     for(int i= ; i<=nx ; i++){
         for(int j= ; j<=ny ; j++){
             if(ok(px[i] , py[j]))
                 g[i][j] = ;
         }
     }
 }

 int dfs(int u)
 {
     for(int v =  ; v<=ny ; v++)
         if(g[u][v] && !visy[v]){
             visy[v] = ;
             if(cy[v] == - || dfs(cy[v])){
                 cx[u] = v;
                 cy[v] = u;
                 return ;
             }
         }
     return ;
 }

 int MaxMatch()
 {
     memset(cx , - , sizeof(cx));
     memset(cy , - , sizeof(cy));
     int ans = ;
     for(int i= ; i<=nx ; i++){
         if(cx[i] == -){
             memset(visy ,  , sizeof(visy));
             ans += dfs(i);
         }
     }
     return ans;
 }

 int main()
 {
   //  freopen("a.in" , "r"  ,stdin);
     while(scanf("%d%d" , &n , &m) , n)
     {
         scanf("%d" , &k);
         int x , y;
         memset(col ,  , sizeof(col));
         while(k--){
             scanf("%d%d" , &x , &y);
             col[x][y] = ;
         }
         nx =  , ny = ;
         for(int i= ; i<=n ; i++)
             for(int j= ; j<=m ; j++)
                 if(!col[i][j]){
                     if((i+j)&) py[++ny] = Point(i,j);
                     else px[++nx] = Point(i,j);
                 }
         //构造二分图
         build_graph();
         printf("%d\n" , MaxMatch());
         for(int i= ; i<=nx ; i++){
             if(cx[i] != -)
                 printf("(%d,%d)--(%d,%d)\n",px[i].x , px[i].y , py[cx[i]].x , py[cx[i]].y);
         }
     }
     return ;
 }