【COGS】746 [网络流24题] 骑士共存 最大独立集

传送门：【COGS】746 [网络流24题] 骑士共存

题目分析：奇偶建图，二分图最大独立集。

代码如下：

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

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

const int MAXN = 80005 ;
const int MAXE = 1000005 ;
const int INF = 0x3f3f3f3f ;

struct Edge {
	int v , c , n ;
	Edge () {}
	Edge ( int v , int c , int n ) : v ( v ) , c ( c ) , n ( n ) {}
} E[MAXE] ;

int H[MAXN] , cntE ;
int d[MAXN] , cnt[MAXN] , pre[MAXN] , cur[MAXN] ;
int Q[MAXN] , head , tail ;
int s , t , nv ;
int flow ;
int n , m ;
bool G[205][205] ;
int next[8][2] = { { -2 , -1 } , { -2 , 1 } , { -1 , -2 } , { -1 , 2 } , { 1 , -2 } , { 1 , 2 } , { 2 , -1 } , { 2 , 1 } } ;

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

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

void rev_bfs () {
	head = tail = 0 ;
	CLR ( cnt , 0 ) ;
	CLR ( d , -1 ) ;
	Q[tail ++] = t ;
	d[t] = 0 ;
	cnt[0] = 1 ;
	while ( head != tail ) {
		int u = Q[head ++] ;
		for ( int i = H[u] ; ~i ; i = E[i].n ) {
			int v = E[i].v ;
			if ( ~d[v] ) {
				d[v] = d[u] + 1 ;
				cnt[d[v]] ++ ;
				Q[tail ++] = v ;
			}
		}
	}
}

int ISAP () {
	CPY ( cur , H ) ;
	rev_bfs () ;
	flow = 0 ;
	int u = pre[s] = s , i , pos , f , minv ;
	while ( d[s] < nv ) {
		if ( u == t ) {
			f = INF ;
			for ( i = s ; i != t ; i = E[cur[i]].v ) if ( f > E[cur[i]].c ) {
				f = E[cur[i]].c ;
				pos = i ;
			}
			for ( i = s ; i != t ; i = E[cur[i]].v ) {
				E[cur[i]].c -= f ;
				E[cur[i] ^ 1].c += f ;
			}
			flow += f ;
			u = pos ;
		}
		for ( i = cur[u] ; ~i ; i = E[i].n ) if ( E[i].c && d[E[i].v] + 1 == d[u] ) break ;
		if ( ~i ) {
			cur[u] = i ;
			pre[E[i].v] = u ;
			u = E[i].v ;
		} else {
			if ( 0 == -- cnt[d[u]] ) break ;
			for ( minv = nv , i = H[u] ; ~i ; i = E[i].n ) if ( E[i].c && minv > d[E[i].v] ) {
				minv = d[E[i].v] ;
				cur[u] = i ;
			}
			d[u] = minv + 1 ;
			cnt[d[u]] ++ ;
			u = pre[u] ;
		}
	}
	return flow ;
}

void solve () {
	int x , y ;
	scanf ( "%d%d" , &n , &m ) ;
	CLR ( G , 0 ) ;
	clear () ;
	int nn = n * n ;
	s = nn * 2 ;
	t = s + 1 ;
	nv = t + 1 ;
	REP ( i , 0 , m ) {
		scanf ( "%d%d" , &x , &y ) ;
		G[x - 1][y - 1] = 1 ;
	}
	REP ( i , 0 , n ) REP ( j , 0 , n ) if ( !G[i][j] ) {
		int ij = i * n + j ;
		if ( ( i + j ) & 1 ) addedge ( s , ij , 1 ) ;
		else addedge ( ij + nn , t , 1 ) ;
		if ( ( i + j ) & 1 ) {
			REP ( k , 0 , 8 ) {
				x = i + next[k][0] ;
				y = j + next[k][1] ;
				if ( !G[x][y] && x >= 0 && x < n && y >= 0 && y < n ) addedge ( ij , x * n + y + nn , 1 ) ;
			}
		}
	}
	printf ( "%d\n" , nn - m - ISAP () ) ;
}

int main () {
	freopen ( "knight.in" , "r" , stdin ) ;
	freopen ( "knight.out" , "w" , stdout ) ;
	solve () ;
	return 0 ;
}