codevs3052&1022

将原图进行黑白染色

将一种颜色的点与上下左右另一种颜色的点连边 做最大匹配

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#define For(i,j,k) for(int i=j;i<=k;i++)
using namespace std;
const int N=100;
const int M=N*N;
struct node{
	int next;
	int to;
	}a[M];
int h[M],cnt;
void addvage(int x,int y){
	cnt++;a[cnt].next=h[x];a[cnt].to=y;h[x]=cnt;
	}
int dx[5]={0,1,-1,0,0};
int dy[5]={0,0,0,1,-1};
int g[N][N],map[N][N];
inline int read(){
    char c=getchar();
    while(c>'9'||c<'0')c=getchar();
    int x=c-'0';
    c=getchar();
    while(c<='9'&&c>='0'){x=x*10+c-'0';c=getchar();}
    return x;
}
int m,n,k;
int w[M],vis[M],ans;
int xiong_yali(int x){
	for(int i=h[x];i;i=a[i].next){
		int y=a[i].to;
		if(vis[y])continue;
		vis[y]=1;
	    if(w[y]==-1||xiong_yali(w[y])){
			w[y]=x;
			return 1;
			}
		}
	return 0;
	}
int main(){
    m=read();n=read();k=read();
	int x,y;
	For(i,1,k){
		x=read();y=read();
		g[x][y]=-1;
		}
	int h=0,b=0;
	For(i,1,m)
		For(j,1,n){
			if(g[i][j]==-1)continue;
		    if((i+j)%2==0)g[i][j]=++h;
			else g[i][j]=++b;
			}
	For(i,1,m)
	    For(j,1,n){
	    if(g[i][j]==-1||(i+j)%2==0)continue;
	    For(p,1,4)if(g[i+dx[p]][j+dy[p]]!=-1&&g[i+dx[p]][j+dy[p]]){
			addvage(g[i][j],g[i+dx[p]][j+dy[p]]);
		   }
		}	
	For(i,1,h)w[i]=-1;
	For(i,1,b){
		memset(vis,0,sizeof(vis));
		ans+=xiong_yali(i);
		}
		cout<<ans;
		return 0;
	}