hdu 4169 二分匹配最大独立集 ***

  1 #include<cstdio>
  2 #include<iostream>
  3 #include<algorithm>
  4 #include<cstring>
  5 #include<cmath>
  6 #include<queue>
  7 #include<map>
  8 using namespace std;
  9 #define MOD 1000000007
 10 const int INF=0x3f3f3f3f;
 11 const double eps=1e-5;
 12 typedef long long ll;
 13 #define cl(a) memset(a,0,sizeof(a))
 14 #define ts printf("*****\n");
 15 int n,m,tt;
 16 /*
 17 * 匈牙利算法邻接表形式
 18 * 使用前用init()进行初始化，给uN赋值
 19 * 加边使用函数addedge(u,v)
 20 *
 21 */
 22 const int MAXN = 2505;//点数的最大值
 23 const int MAXM = 50010;//边数的最大值
 24 struct Edge
 25 {
 26     int to,next;
 27 }edge[MAXM];
 28 int head[MAXN],tot;
 29 void init()
 30 {
 31     tot = 0;
 32     memset(head,-1,sizeof(head));
 33 }
 34 void addedge(int u,int v)
 35 {
 36     edge[tot].to = v; edge[tot].next = head[u];
 37     head[u] = tot++;
 38 }
 39 int linker[MAXN];
 40 bool used[MAXN];
 41 int uN;
 42 bool dfs(int u)
 43 {
 44     for(int i = head[u]; i != -1 ;i = edge[i].next)
 45     {
 46         int v = edge[i].to;
 47         if(!used[v])
 48         {
 49             used[v] = true;
 50             if(linker[v] == -1 || dfs(linker[v]))
 51             {
 52                 linker[v] = u;
 53                 return true;
 54             }
 55         }
 56     }
 57     return false;
 58 }
 59 int hungary()
 60 {
 61     int res = 0;
 62     memset(linker,-1,sizeof(linker));
 63     for(int u = 0; u < uN;u++)//点的编号0~uN-1
 64     {
 65         memset(used,false,sizeof(used));
 66         if(dfs(u))res++;
 67     }
 68     return res;
 69 }
 70 pair<int,int> p1[MAXN];
 71 pair<int,int> p2[MAXN];
 72 int main()
 73 {
 74     int i,j,k;
 75     #ifndef ONLINE_JUDGE
 76     freopen("1.in","r",stdin);
 77     #endif
 78     while(scanf("%d%d",&n,&m)!=EOF)
 79     {
 80         if(n==0&&m==0)  break;
 81         init();
 82         int x,y;
 83         for(i=0;i<n;i++)
 84         {
 85             scanf("%d%d",&x,&y);
 86             p1[i]=make_pair(x,y);
 87         }
 88         for(i=0;i<m;i++)
 89         {
 90             scanf("%d%d",&x,&y);
 91             p2[i]=make_pair(x,y);
 92         }
 93         uN=n;
 94         for(i=0;i<n;i++)
 95         {
 96             for(j=0;j<m;j++)
 97             {
 98                 int x1=p1[i].first;
 99                 int y1=p1[i].second;
100                 int x2=p2[j].first;
101                 int y2=p2[j].second;
102                 if((x1==x2&&y1==y2)||(x1+1==x2&&y1==y2)||(x1==x2&&y1==y2+1)||(x1+1==x2&&y1==y2+1))
103                 {
104                     addedge(i,j);
105                 }
106             }
107         }
108         printf("%d\n",n+m-hungary());
109     }
110 }