【POJ】2446 Chessboard 二分匹配

传送门：【POJ】2446 Chessboard

题目分析：二分匹配模板题，将网格黑白染色，分成X集合和Y集合（障碍物除外），X集合向相邻的可以到达的Y集合的点建边，二分匹配数*2==n*m-p即YES，否则NO。

代码如下：

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

#define REP( i , a , b ) for ( int i = a ; i < b ; ++ i )
#define REV( i , a , b ) for ( int i = a - 1 ; i >= b ; -- i )
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define FOV( i , a , b ) for ( int i = a ; i >= b ; -- i )
#define CLR( a , x ) memset ( a , x , sizeof a )

const int MAXN = 520 ;
const int MAXQ = 1200 ;
const int MAXE = 10005 ;
const int INF = 0x3f3f3f3f ;

struct Edge {
	int v , n ;
	Edge () {}
	Edge ( int v , int n ) : v ( v ) , n ( n ) {}
} ;

Edge E[MAXE] ;
int H[MAXN] , cntE ;
int Q[MAXQ] , head , tail ;
int Lx[MAXN] , Ly[MAXN] ;
int dx[MAXN] , dy[MAXN] ;
bool vis[MAXN] ;
int n , m , p ;
int dis ;
int G[33][33] , idx , idy ;

void init () {
	cntE = 0 ;
	CLR ( H , -1 ) ;
}

void addedge ( int u , int v ) {
	E[cntE] = Edge ( v , H[u] ) ;
	H[u] = cntE ++ ;
}

int Hopcroft_Krap () {
	dis = INF ;
	CLR ( dx , -1 ) ;
	CLR ( dy , -1 ) ;
	head = tail = 0 ;
	FOR ( i , 1 , idx )
		if ( Lx[i] == -1 ) {
			dx[i] = 0 ;
			Q[tail ++] = i ;
		}
	while ( head != tail ) {
		int u = Q[head ++] ;
		if ( dx[u] >= dis )
			continue ;
		for ( int i = H[u] ; ~i ; i = E[i].n ) {
			int v = E[i].v ;
			if ( dy[v] == -1 ) {
				dy[v] = dx[u] + 1 ;
				if ( Ly[v] == -1 )
					dis = dy[v] ;
				else {
					dx[Ly[v]] = dy[v] + 1 ;
					Q[tail ++] = Ly[v] ;
				}
			}
		}
	}
	return dis != INF ;
}

int find ( int u ) {
	for ( int i = H[u] ; ~i ; i = E[i].n ) {
		int v = E[i].v ;
		if ( !vis[v] && dy[v] == dx[u] + 1 ) {
			vis[v] = 1 ;
			if ( ~Ly[v] && dy[v] == dis )
				continue ;
			if ( Ly[v] == -1 || find ( Ly[v] ) ) {
				Lx[u] = v ;
				Ly[v] = u ;
				return 1 ;
			}
		}
	}
	return 0 ;
}

int match () {
	int ans = 0 ;
	CLR ( Lx , -1 ) ;
	CLR ( Ly , -1 ) ;
	while ( Hopcroft_Krap () ) {
		CLR ( vis , 0 ) ;
		FOR ( i , 1 , idx )
			if ( Lx[i] == -1 )
				ans += find ( i ) ;
	}
	return ans ;
}

void solve () {
	int x , y ;
	init () ;
	CLR ( G , 0 ) ;
	idx = 0 ;
	idy = 0 ;
	REP ( i , 0 , p ) {
		scanf ( "%d%d" , &x , &y ) ;
		G[y][x] = -1 ;
	}
	FOR ( i , 1 , n )
		FOR ( j , 1 , m )
			if ( ~G[i][j] ) {
				if ( ( i + j ) & 1 )
					G[i][j] = ++ idx ;
				else
					G[i][j] = ++ idy ;
			}
	FOR ( i , 1 , n )
		FOR ( j , 1 , m )
			if ( ( ( i + j ) & 1 ) && ~G[i][j] ) {
				if ( i > 1 && ~G[i - 1][j] )
					addedge ( G[i][j] , G[i - 1][j] ) ;
				if ( i < n && ~G[i + 1][j] )
					addedge ( G[i][j] , G[i + 1][j] ) ;
				if ( j > 1 && ~G[i][j - 1] )
					addedge ( G[i][j] , G[i][j - 1] ) ;
				if ( j < m && ~G[i][j + 1] )
					addedge ( G[i][j] , G[i][j + 1] ) ;
			}
	if ( ( match () << 1 ) == n * m - p )
		printf ( "YES\n" ) ;
	else
		printf ( "NO\n" ) ;
}
				
int main () {
	while ( ~scanf ( "%d%d%d" , &n , &m , &p ) )
		solve () ;
	return 0 ;
}