二分图

/*
http://acm.hdu.edu.cn/showproblem.php?pid=1507

二分图，根据奇偶性（x+y）分成2个集合，再有相连的连上边。求出最大匹配
*/
#include<iostream>
#include<cstdio>
#include<string>
#include<memory.h>
using namespace std;
int map[105][105],link[105],n,m,k,M,N;
bool  vis[105],mark[105][105];
int dir[4][2]={1,0,0,1,-1,0,0,-1};
struct node
{
    int x,y;
}p1[6000],p2[6000];
struct px
{
    node t1,t2;
}p[10005];
int cmp(const void *a,const void *b)
{
    struct px *c=(px *)a;
    struct px *d=(px *)b;
    if(c->t1.x!=d->t1.x)return c->t1.x-d->t1.x;
    else return c->t1.y-d->t1.y;
}
bool find(int x)
{
    int i;
    for(i=1;i<=m;i++)
    {
        if(!vis[i]&&map[x][i])
        {
            vis[i]=1;
            if(link[i]==-1||find(link[i]))
            {
                link[i]=x;
                return 1;
            }
        }
    }
    return 0;
}
int get_match()
{
    int i,ans=0;
    memset(link,-1,sizeof(link));
    for(i=1;i<=n;i++)
    {
        memset(vis,0,sizeof(vis));
        if(find(i))ans++;
    }
    return ans;
}
void Init()
{
    int a,b;
    memset(map,0,sizeof(map));
    memset(mark,0,sizeof(mark));
    scanf("%d",&k);
    while(k--)
    {
        scanf("%d%d",&a,&b);
        mark[a][b]=1;
    }
}
void Solve()
{
    int i,j,tx,ty,id1=1,id2=1,flag;
    for(i=1;i<=N;i++)
        for(j=1;j<=M;j++)
        {
            flag=0;
            if(!mark[i][j]&&((i+j)%2==1))
            {
                mark[i][j]=1;
                for(int kk=0;kk<4;kk++)
                {
                    tx=i+dir[kk][0];
                    ty=j+dir[kk][1];
                    if(tx>=1&&tx<=N&&ty>=1&&ty<=M&&!mark[tx][ty])
                    {
                        int qq=0;
                        for(int ll=1;ll<id2;ll++)
                        {
                            if(tx==p2[ll].x&&ty==p2[ll].y)
                            {
                                qq=ll;
                                break;
                            }
                        }
                        if(qq!=0)
                        {
                            map[id1][qq]=1;
                            flag=1;
                        }
                        else
                        {
                           
                            //printf("** (%d %d)-->(%d %d)\n",i,j,tx,ty);
                            //mark[tx][ty]=-1;
                            p2[id2].x=tx;
                            p2[id2].y=ty;
                            map[id1][id2]=1;
                        //printf("~ %d %d\n",id1,id2);
                            id2++;
                            flag=1;
                        }
                    }
                }
                if(flag)
                {
                    p1[id1].x=i;
                    p1[id1].y=j;
                    id1++;
                }
            }
        }
        n=id1-1;
        m=id2-1;
        int sum=get_match();
        printf("%d\n",sum);
        int pos=0;
        for(i=1;i<=m;i++)
            if(link[i]!=-1)
            {
            //    printf("@\n");
                if(p1[link[i]].x<p2[i].x||(p1[link[i]].x==p2[i].x&&p1[link[i]].y<p2[i].y))
                //printf("(%d,%d)--(%d,%d)\n",p1[link[i]].x,p1[link[i]].y,p2[i].x,p2[i].y);
                {
                    p[pos].t1=p1[link[i]];
                    p[pos++].t2=p2[i];
                }

                else
                {
                         //printf("(%d,%d)--(%d,%d)\n",p2[i].x,p2[i].y,p1[link[i]].x,p1[link[i]].y);
                        p[pos].t1=p2[i];
                    p[pos++].t2=p1[link[i]];

                }
            }
            qsort(p,sum,sizeof(p[0]),cmp);
            for(i=0;i<sum;i++)
            {
                printf("(%d,%d)--(%d,%d)\n",p[i].t1.x,p[i].t1.y,p[i].t2.x,p[i].t2.y);
            }
            printf("\n");
}
int main()
{
    while(scanf("%d%d",&N,&M)!=EOF)
    {
        if(M==0&&N==0)break;
        Init();
        Solve();
    }
    return 0;
}

PS：二分图还没怎么写过。尴尬。要好好奋斗了。话说WA了很多次，很脑残的错误。。。