【POJ】3308 Paratroopers 化乘为加——最小点权覆盖

传送门：【POJ】3308 Paratroopers

题目分析：逗比了求的是乘积最小一开始自作聪明还求加法最小再乘了。。。。

首先很容易看出这题是最小点权覆盖问题，源点向行建边，列向汇点建边，每一对( x，y )，建边( x，n+y，INF )，那么怎么样做去求乘积最小呢？其实我们可以用一个数学方法解决。因为log(a*b*c) = log(a) + log(b) + log(c)，因此，求乘积最小其实就相当于对点权取对数后求最小的点权和，最后eps(flow)一下就可以得到原来的最小乘积了。

代码如下：

#include <cmath>
#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 )
#define CPY( a , x ) memcpy ( a , x , sizeof a )

typedef long long LL ;
typedef double type_c ;

const int MAXN = 105 ;
const int MAXQ = 105 ;
const int MAXE = 1205 ;
const double INF = 1e10 ;
const double eps = 1e-8 ;

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

struct Net {
	Edge E[MAXE] ;
	int H[MAXN] , cntE ;
	int d[MAXN] , cur[MAXN] , pre[MAXN] , num[MAXN] ;
	int Q[MAXQ] , head , tail ;
	int s , t , nv ;
	type_c flow ;
	
	int n , m , q ;
	
	int sgn ( double x ) {
		return ( x > eps ) - ( x < -eps ) ;
	}
	
	void init () {
		cntE = 0 ;
		CLR ( H , -1 ) ;
	}
	
	void addedge ( int u , int v , type_c c , type_c rc = 0 ) {
		E[cntE] = Edge ( v ,  c , H[u] ) ;
		H[u] = cntE ++ ;
		E[cntE] = Edge ( u , rc , H[v] ) ;
		H[v] = cntE ++ ;
	}
	
	void rev_bfs () {
		CLR ( d , -1 ) ;
		CLR ( num , 0 ) ;
		head = tail = 0 ;
		Q[tail ++] = t ;
		d[t] = 0 ;
		num[d[t]] = 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] == -1 ) {
					Q[tail ++] = v ;
					d[v] = d[u] + 1 ;
					num[d[v]] ++ ;
				}
			}
		}
	}
	
	type_c ISAP () {
		CPY ( cur , H ) ;
		rev_bfs () ;
		flow = 0 ;
		int u = pre[s] = s , i , pos , mmin ;
		while ( d[s] < nv ) {
			if ( u == t ) {
				type_c 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 ;
				}
				u = pos ;
				flow += f ;
			}
			for ( i = cur[u] ; ~i ; i = E[i].n )
				if ( sgn ( E[i].c ) && d[u] == d[E[i].v] + 1 )
					break ;
			if ( ~i ) {
				cur[u] = i ;
				pre[E[i].v] = u ;
				u = E[i].v ;
			}
			else {
				if ( 0 == -- num[d[u]] )
					break ;
				for ( mmin = nv , i = H[u] ; ~i ; i = E[i].n )
					if ( sgn ( E[i].c ) && mmin > d[E[i].v] ) {
						mmin = d[E[i].v] ;
						cur[u] = i ;
					}
				d[u] = mmin + 1 ;
				num[d[u]] ++ ;
				u = pre[u] ;
			}
		}
		return flow ;
	}
	
	void solve () {
		int u , v ;
		double c , res = 1.0 ;
		scanf ( "%d%d%d" , &n , &m , &q ) ;
		s = 0 ;
		t = n + m + 1 ;
		nv = t + 1 ;
		init () ;
		FOR ( i , 1 , n ) {
			scanf ( "%lf" , &c ) ;
			addedge ( s , i , log ( c ) ) ;
		}
		FOR ( i , 1 , m ) {
			scanf ( "%lf" , &c ) ;
			addedge ( i + n , t , log ( c ) ) ;
		}
		REP ( i , 0 , q ) {
			scanf ( "%d%d" , &u , &v ) ;
			addedge ( u , n + v , INF ) ;
		}
		ISAP () ;
		printf ( "%.4f\n" , exp ( flow ) ) ;
	}
} e ;

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