【POJ】3228 Gold Transportation 二分+最大流or并查集

传送门：【POJ】3228 Gold Transportation

题目分析：

很早以前用的二分+最大流过的。。。。这次突然发现其实并查集也可以写。。。然后又把两种都敲了一遍。。。

网络流的方法比较简单，二分能添加的边的上限建图就好了。

并查集的话，只要出现金矿和商店在同一个连通块并且保证金矿都能被商店接受就好了。

并查集代码：

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

#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REPV( i , a , b ) for ( int i = a ; i >= b ; -- i )
#define clear( a , x ) memset ( a , x , sizeof a )
#define copy( a , x ) memcpy ( a , x , sizeof a )

const int MAXN = 205 ;
const int MAXE = 20005 ;
const int INF = 0x3f3f3f3f ;


struct Line {
	int x , y , c ;
	void input () {
		scanf ( "%d%d%d" , &x , &y , &c ) ;
	}
	bool operator < ( const Line &a ) const {
		return c < a.c ;
	}
} ;

Line a[MAXE] ;
int p[MAXN] ;
int goal[MAXN] ;
int store[MAXN] ;
int sum_goal ;
int sum_store ;
int n , m ;

int find ( int x ) {
	return p[x] == x ? x : ( p[x] = find ( p[x] ) ) ;
}

void input () {
	sum_goal = 0 ;
	REPF ( i , 1 , n )
		scanf ( "%d" , &goal[i] ) ;
	REPF ( i , 1 , n ) {
		scanf ( "%d" , &store[i] ) ;
		if ( goal[i] ) {
			if ( goal[i] >= store[i] )
				goal[i] -= store[i] , store[i] = 0 ;
			else
				store[i] -= goal[i] , goal[i] = 0 ;
		}
		sum_goal += goal[i] ;
	}
	scanf ( "%d" , &m ) ;
	REP ( i , m )
		a[i].input () ;
}

void solve () {
	input () ;
	if ( sum_goal <= 0 ) {
		printf ( "0\n" ) ;
		return ;
	}
	REPF ( i , 1 , n )
		p[i] = i ;
	sort ( a , a + m ) ;
	sum_store = 0 ;
	int i ;
	for ( i = 0 ; i < m ; ++ i ) {
		int x = find ( a[i].x ) ;
		int y = find ( a[i].y ) ;
		if ( x != y ) {
			goal[y] += goal[x] ;
			store[y] += store[x] ;
			p[x] = y ;
			if ( goal[y] >= store[y] && store[y] ) {
				goal[y] -= store[y] ;
				sum_goal -= store[y] ;
				store[y] = 0 ;
			}
			else if ( goal[y] <= store[y] && goal[y] ) {
				store[y] -= goal[y] ;
				sum_goal -= goal[y] ;
				goal[y] = 0 ;
			}
			if ( !sum_goal )
				break ;
		}
	}
	printf ( i < m ? "%d\n" : "No Solution\n" , a[i].c ) ;
}

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

最大流代码：

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

#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REPV( i , a , b ) for ( int i = a ; i >= b ; -- i )
#define clear( a , x ) memset ( a , x , sizeof a )
#define copy( a , x ) memcpy ( a , x , sizeof a )

const int MAXN = 205 ;
const int MAXQ = 205 ;
const int MAXE = 100005 ;
const int INF = 0x3f3f3f3f ;

struct Edge {
	int v , c , n ;
	Edge () {}
	Edge ( int var , int cost , int next ) : v ( var ) , c ( cost ) , n ( next ) {}
} ;

struct Line {
	int u , v , c ;
	void input () {
		scanf ( "%d%d%d" , &u , &v , &c ) ;
	}
} ;

struct NetWork {
	Edge E[MAXE] ;
	int hd[MAXN] , cntE ;
	int d[MAXN] , cur[MAXN] , pre[MAXN] , num[MAXN] ;
	bool vis[MAXN] ;
	int Q[MAXQ] ;
	int head , tail ;
	int n , m ;
	int s , t , nv ;
	int flow ;
	
	Line a[MAXE] ;
	int goal[MAXN] ;
	int store[MAXN] ;
	int sum_goal , sum_store ;
	
	void init () {
		cntE = 0 ;
		clear ( hd , -1 ) ;
	}
	
	void addedge ( int u , int v , int c ) {
		E[cntE] = Edge ( v , c , hd[u] ) ;
		hd[u] = cntE ++ ;
		E[cntE] = Edge ( u , c , hd[v] ) ;
		hd[v] = cntE ++ ;
	}
	
	void rev_Bfs () {
		head = tail = 0 ;
		clear ( num , 0 ) ;
		clear ( vis , 0 ) ;
		d[t] = 0 ;
		vis[t] = 1 ;
		num[0] = 1 ;
		Q[tail ++] = t ;
		while ( head != tail ) {
			int u = Q[head ++] ;
			for ( int i = hd[u] ; ~i ; i = E[i].n ) {
				int v = E[i].v ;
				if ( !vis[v] ) {
					vis[v] = 1 ;
					d[v] = d[u] + 1 ;
					Q[tail ++] = v ;
					++ num[d[v]] ;
				}
			}
		}
	}
	
	int isap () {
		copy ( cur , hd ) ;
		rev_Bfs () ;
		flow = 0 ;
		int u = pre[s] = s , i ;
		while ( d[s] < nv ) {
			if ( u == t ) {
				int pos , f = INF ;
				for ( i = s ; i != t ; i = E[cur[i]].v )
					if ( f > E[cur[i]].c ) {
						pos = i ;
						f = E[cur[i]].c ;
					}
				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[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 ;
				int mmin = nv ;
				for ( i = hd[u] ; ~i ; i = E[i].n )
					if ( 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 ;
	}
	
	int input () {
		if ( scanf ( "%d" , &n ) == EOF || !n )
			return 0 ;
			
		sum_goal = 0 , sum_store = 0 ;
		
		REPF ( i , 1 , n ) {
			scanf ( "%d" , &goal[i] ) ;
			sum_goal += goal[i] ;
		}
		REPF ( i , 1 , n ) {
			scanf ( "%d" , &store[i] ) ;
			sum_store += store[i] ;
		}
		scanf ( "%d" , &m ) ;
		REP ( i , m )
			a[i].input () ;
		return 1 ;
	}
	
	void build ( int mid ) {
		init () ;
		REP ( i , m )
			if ( a[i].c <= mid )
				addedge ( a[i].u , a[i].v , INF ) ;
		REPF ( i , 1 , n )
			if ( goal[i] )
				addedge ( s , i , goal[i] ) ;
		REPF ( i , 1 , n )
			if ( store[i] )
				addedge ( i , t , store[i] ) ;
	}
		
	void solve () {
		if ( sum_goal > sum_store ) {
			printf ( "No Solution\n" ) ;
			return ;
		}
		s = 0 , t = n + 1 , nv = t + 1 ;
		int mid , l = 0 , r = 10005 , ans = 0 ;
		while ( l < r ) {
			mid = ( l + r ) >> 1 ;
			build ( mid ) ;
			if ( isap () == sum_goal ) {
				ans = mid ;
				r = mid ;
			}
			else
				l = mid + 1 ;
		}
		printf ( ans ? "%d\n" : "No Solution\n" , ans ) ;
	}
} ;

NetWork z ;

int main () {
	while ( z.input () )
		z.solve () ;
	return 0 ;
}