【HDU】1816 Get Luffy Out * &【POJ】2723 Get Luffy Out 【2-sat】

传送门：【HDU】1816 Get Luffy Out *、【POJ】2723 Get Luffy Out

题目分析：每个钥匙我们给他两个状态选( i )和不选( ~i )。

两把钥匙x，y一组，则只能选择其中一把：< x , ~y > , < y , ~x >

打开一扇门至少要一把钥匙，一道门上有两个锁孔x，y：< ~x , y > , < ~y , x >

最后二分能打开的门的最大数量，求2-sat。

注意HDU的题目里面一把钥匙可以出现在多个pair里面，而POJ的题目里面一把钥匙只属于一个pair。

代码如下：

#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 = 4096 ;
const int MAXE = 10000 ;

struct Edge {
	int v ;
	Edge* next ;
} E[MAXE] , *H[MAXN] , *cur , *pre , *rH[MAXN] ;

struct Point {
	int x , y ;
} p[2048] ;

int dfn[MAXN] , low[MAXN] , scc[MAXN] , scc_cnt ;
int S[MAXN] , top , dfs_clock ;
int n , m ;

void init () {
	cur = pre ;
	top = scc_cnt = dfs_clock = 0 ;
	CPY ( H , rH ) ;
	CLR ( dfn , 0 ) ;
	CLR ( scc , 0 ) ;
}

void addedge ( int u , int v ) {
	cur -> v = v ;
	cur -> next = H[u] ;
	H[u] = cur ++ ;
}

void tarjan ( int u ) {
	dfn[u] = low[u] = ++ dfs_clock ;
	S[top ++] = u ;
	for ( Edge* e = H[u] ; e ; e = e -> next ) {
		int v = e -> v ;
		if ( !dfn[v] ) {
			tarjan ( v ) ;
			low[u] = min ( low[u] , low[v] ) ;
		} else if ( !scc[v] ) low[u] = min ( low[u] , dfn[v] ) ;
	}
	if ( low[u] == dfn[u] ) {
		++ scc_cnt ;
		do {
			scc[S[-- top]] = scc_cnt ;
		} while ( u != S[top] ) ;
	}
}

int ok () {
	REP ( i , 0 , n << 2 ) if ( !dfn[i] ) tarjan ( i ) ;
	REP ( i , 0 , n << 1 ) if ( scc[i << 1] == scc[i << 1 | 1] ) return 0 ;
	return 1 ;
}

void scanf ( int& x , char c = 0 ) {
	while ( ( c = getchar () ) < '0' || c > '9' ) ;
	x = c - '0' ;
	while ( ( c = getchar () ) >= '0' && c <= '9' ) x = x * 10 + c - '0' ;
}

void solve () {
	int x , y ;
	cur = E ;
	CLR ( H , 0 ) ;
	REP ( i , 0 , n ) {
		scanf ( x ) ;
		scanf ( y ) ;
		addedge ( x << 1 , y << 1 | 1 ) ;
		addedge ( y << 1 , x << 1 | 1 ) ;
	}
	REP ( i , 0 , m ) {
		scanf ( p[i].x ) ;
		scanf ( p[i].y ) ;
	}
	pre = cur ;
	CPY ( rH , H ) ;
	int l = 0 , r = m ;
	while ( l < r ) {
		int mid = ( l + r + 1 ) >> 1 ;
		init () ;
		REP ( i , 0 , mid ) {
			addedge ( p[i].x << 1 | 1 , p[i].y << 1 ) ;
			addedge ( p[i].y << 1 | 1 , p[i].x << 1 ) ;
		}
		if ( ok () ) l = mid ;
		else r = mid - 1 ;
	}
	printf ( "%d\n" , l ) ;
}
	
int main () {
	while ( ~scanf ( "%d%d" , &n , &m ) && ( n || m ) ) solve () ;
	return 0 ;
}