【HDU】2236 无题II 二分+二分匹配

传送门：【HDU】2236 无题II

题目分析：暴力二分都能过。。。Orz

本题我们可以通过二分差值区间，然后枚举下界做二分匹配，如果完美匹配，则说明这个差值是可行， 调整二分上界，否则调整二分下界。（我觉得代码能比我说的更清楚）

代码如下：

#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 )

const int MAXN = 105 ;
const int MAXQ = 105 ;
const int MAXE = 10005 ;
const int INF = 0x3f3f3f3f ;

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

int H[MAXN] , cntE ;
int dx[MAXN] , dy[MAXN] ;
int Lx[MAXN] , Ly[MAXN] ;
int Q[MAXQ] , head , tail ;
int vis[MAXN] ;
int dis ;
int n ;

int G[MAXN][MAXN] ;

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

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

int Hopcroft_Karp () {
	dis = INF ;
	head = tail = 0 ;
	CLR ( dx , -1 ) ;
	CLR ( dy , -1 ) ;
	FOR ( i , 1 , n )
		if ( Lx[i] == -1 ) {
			Q[tail ++] = i ;
			dx[i] = 0 ;
		}
	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 hungary ( 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 || hungary ( Ly[v] ) ) {
				Lx[u] = v ;
				Ly[v] = u ;
				return 1 ;
			}
		}
	}
	return 0 ;
}

int match () {
	int res = 0 ;
	CLR ( Lx , -1 ) ;
	CLR ( Ly , -1 ) ;
	while ( Hopcroft_Karp () ) {
		CLR ( vis , 0 ) ;
		FOR ( i , 1 , n )
			if ( Lx[i] == -1 )
				res += hungary ( i ) ;
	}
	return res ;
}

void solve () {
	int mmin = 100 , mmax = 0 ;
	scanf ( "%d" , &n ) ;
	FOR ( i , 1 , n )
		FOR ( j , 1 , n ) {
			scanf ( "%d" , &G[i][j] ) ;
			mmin = min ( G[i][j] , mmin ) ;
			mmax = max ( G[i][j] , mmax ) ;
		}
	int l = 0 , r = mmax - mmin + 1 ;
	while ( l < r ) {
		int m = ( r + l ) >> 1 ;
		int flag = 0 ;
		for ( int i = mmin ; i + m <= mmax ; ++ i ) {
			init () ;
			FOR ( x , 1 , n )
				FOR ( y , 1 , n )
					if ( G[x][y] >= i && G[x][y] <= i + m )
						addedge ( x , y ) ;
			if ( n == match () )
				flag = 1 ;
			if ( flag )
				break ;
		}
		if ( flag )
			r = m ;
		else
			l = m + 1 ;
	}
	printf ( "%d\n" , l ) ;
}

int main () {
	int T ;
	scanf ( "%d" , &T ) ;
	while ( T -- )
		solve () ;
	return 0 ;
}