【网络流】 POJ 2125 Destroying The Graph

amber的最小割的论文题。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
using namespace std;

const int maxm = 30005;

struct Edge
{
	int v, c, next;
	Edge() {}
	Edge(int v, int c, int next) : v(v), c(c), next(next) {}
}E[maxm];

const int maxn = 205;
const int INF = 0x3f3f3f3f;

queue<int> q;
int H[maxn], cntE;
int dis[maxn];
int cur[maxn];
int cnt[maxn];
int pre[maxn];
int n, m, s, t, flow, nv;

void addedges(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 bfs()
{
	memset(cnt, 0, sizeof cnt);
	memset(dis, -1, sizeof dis);
	cnt[0]++, dis[t] = 0;
	q.push(t);
	while(!q.empty()) {
		int u = q.front();
		q.pop();
		for(int e = H[u]; ~e; e = E[e].next) {
			int v = E[e].v;
			if(dis[v] == -1) {
				dis[v] = dis[u] + 1;
				cnt[dis[v]]++;
				q.push(v);
			}
		}
	}
}

int isap()
{
	memcpy(cur, H, sizeof cur);
	bfs();
	flow = 0;
	int u = pre[s] = s, f, minv, e, pos;
	while(dis[s] < nv) {
		if(u == t) {
			f = INF;
			for(int i = s; i != t; i = E[cur[i]].v) if(f > E[cur[i]].c) {
				f = E[cur[i]].c;
				pos = i;
			}
			for(int 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(e = cur[u]; ~e; e = E[e].next) if(E[e].c && dis[E[e].v] + 1 == dis[u]) break;
		if(~e) {
			cur[u] = e;
			pre[E[e].v] = u;
			u = E[e].v;
		}
		else {
			if(--cnt[dis[u]] == 0) break;
			for(minv = nv, e = H[u]; ~e; e = E[e].next) if(E[e].c && minv > dis[E[e].v]) {
				minv = dis[E[e].v];
				cur[u] = e;
			}
			dis[u] = minv + 1;
			cnt[dis[u]]++;
			u = pre[u];
		}
	}
	return flow;
}

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

int res[maxn];

void dfs(int u)
{
	if(res[u]) return;
	res[u] = 1;
	for(int e = H[u]; ~e; e = E[e].next) if(E[e].c) dfs(E[e].v);
}


void work()
{
	int u, v, x;
	s = 0, t = 2 * n + 1, nv = t + 1;
	for(int i = 1; i <= n; i++) {
		scanf("%d", &x);
		addedges(s, i, x);
	}

	for(int i = 1; i <= n; i++) {
		scanf("%d", &x);
		addedges(i + n, t, x);
	}

	for(int i = 1; i <= m; i++) {
		scanf("%d%d", &u, &v);
		addedges(v, u + n, INF);
	}
	
	printf("%d\n", isap());
	memset(res, 0, sizeof res);
	dfs(s);

	int ans = 0;
	for(int i = 1; i <= n; i++) ans += !res[i] + res[i+n];
	printf("%d\n", ans);

	for(int i = 1; i <= n; i++) if(!res[i]) printf("%d +\n", i);
	for(int i = 1; i <= n; i++) if(res[i + n]) printf("%d -\n", i);
}

int main()
{
	while(scanf("%d%d", &n, &m) != EOF) {
		init();
		work();
	}
	
	return 0;
}