【HDU】3491 Thieves 最小点割集

传送门：【HDU】3491 Thieves

题目分析：无向图建成有向图= =||。。。。本题这么简单竟然还错了这么多次。。。

反正就是一个点x拆成两个点x，x'，建边<x,x'>，容量为点权。然后有边(u,v)则建边(u',v),(v',u)，容量为无穷大。

然后跑最大流就好了。。。比较坑爹的是题目明明说了输出换行！！但是事实是不用输出= =||

代码如下：

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

const int MAXN = 250 ;
const int MAXQ = 250005 ;
const int MAXE = 250005 ;
const int INF = 0x3f3f3f3f ;

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

struct NetWork {
	Edge E[MAXE] ;
	int H[MAXN] , cntE ;
	int d[MAXN] , cur[MAXN] , num[MAXN] , pre[MAXN] ;
	int Q[MAXQ] , head , tail ;
	int s , t , nv , flow ;
	int n , m ;
	int st , ed ;
	
	void init () {
		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 () {
		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] )
					continue ;
				d[v] = d[u] + 1 ;
				Q[tail ++] = v ;
				num[d[v]] ++ ;
			}
		}
	}

	int ISAP () {
		CPY ( cur , H ) ;
		rev_bfs () ;
		flow = 0 ;
		int u = pre[s] = s , i ;
		while ( d[s] < nv ) {
			if ( u == t ) {
				int f = INF , pos ;
				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[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 = H[u] ; ~i ; i = E[i].n )
					if ( E[i].c && mmin > d[E[i].v] ) {
						cur[u] = i ;
						mmin = d[E[i].v] ;
					}
				d[u] = mmin + 1 ;
				num[d[u]] ++ ;
				u = pre[u] ;
			}
		}
		return flow ;
	}
	
	void solve () {
		int u , v , c ;
		scanf ( "%d%d%d%d" , &n , &m , &st , &ed ) ;
		s = st + n ;
		t = ed ;
		nv = n << 1 | 1 ;
		init () ;
		FOR ( i , 1 , n ) {
			scanf ( "%d" , &c ) ;
			if ( i != st && i != ed )
				addedge ( i , i + n , c ) ;
		}
		REP ( i , 0 , m ) {
			scanf ( "%d%d" , &u , &v ) ;
			addedge ( u + n , v , INF ) ;
			addedge ( v + n , u , INF ) ;
		}
		ISAP () ;
		printf ( "%d\n" , flow ) ;
	}
} x ;

int main () {
	int T , cas = 0 ;
	scanf ( "%d" , &T ) ;
	while ( T -- ) {
		//printf ( "Case %d: " , ++ cas ) ;
		x.solve () ;
	}
	return 0 ;
}