题目:
http://poj.org/problem?id=2125
题意:
给定一个有向图,要把所有的边删掉,有两种操作,一种是把某个点的所有入边全部删掉,有一个相应的花费,另一种是把某个点所有的出边全部删掉,也有一个相应的花费,问删除所有边的最小花费是多少
思路:
因为每个点有入边和出边,因此可以看成两个点,点权分别为删掉入边和出边的相应花费,于是可以发现,本题就是一个二分图最小点权覆盖集模型。
建边方法:把点i拆成i和i+n两个点,从i+n向汇点连边,容量为删除入边的花费,从源点向i连边,容量为删除出边的花费,然后对于有边的两个点,连边a和b+n,容量无穷大。刚开始我把图建反了,后来想一想,对于a和b+n之间的边,对于a是出边,所以应该是s和a连边,容量为删除出边的花费,对于b是入边,b+n和汇点连边,容量为删除入边的花费。对于输出方案,可以从源点进行一次dfs,1~n点中不能访问的点,说明
流量已用尽,是最小割的一条边,n+1~2*n点中能访问的点,说明此点和汇点之间的流量已用尽,是最小割的一条边。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
using namespace std;
const int N = 210, INF = 0x3f3f3f3f;
struct edge
{
int to, cap, next;
}g[N*N*2];
int cnt, head[N];
int gap[N], que[N], level[N], pre[N], cur[N];
bool vis[N];
int ss, tt, nv;
void add_edge(int v, int u, int cap)
{
g[cnt].to = u, g[cnt].cap = cap, g[cnt].next = head[v], head[v] = cnt++;
g[cnt].to = v, g[cnt].cap = 0, g[cnt].next = head[u], head[u] = cnt++;
}
void bfs(int t)
{
memset(level, -1, sizeof level);
memset(gap, 0, sizeof gap);
int st = 0, en = 0;
level[t] = 0;
que[en++] = t;
gap[level[t]]++;
while(st < en)
{
int v = que[st++];
for(int i = head[v]; i != -1; i = g[i].next)
{
int u = g[i].to;
if(level[u] < 0)
{
level[u] = level[v] + 1;
gap[level[u]]++;
que[en++] = u;
}
}
}
}
int sap(int s, int t)
{
bfs(t);
memcpy(cur, head, sizeof head);
int v = pre[s] = s, flow = 0, aug = INF;
while(level[s] < nv)
{
bool flag = false;
for(int &i = cur[v]; i != -1; i = g[i].next)
{
int u = g[i].to;
if(g[i].cap > 0 && level[v] == level[u] + 1)
{
flag = true;
pre[u] = v;
v = u;
aug = min(aug, g[i].cap);
if(v == t)
{
flow += aug;
while(v != s)
{
v = pre[v];
g[cur[v]].cap -= aug;
g[cur[v]^1].cap += aug;
}
aug = INF;
}
break;
}
}
if(flag) continue;
int minlevel = nv;
for(int i = head[v]; i != -1; i = g[i].next)
{
int u = g[i].to;
if(g[i].cap > 0 && level[u] < minlevel)
minlevel = level[u], cur[v] = i;
}
if(--gap[level[v]] == 0) break;
level[v] = minlevel + 1;
gap[level[v]]++;
v = pre[v];
}
return flow;
}
void dfs(int v)
{
vis[v] = true;
for(int i = head[v]; i != -1; i = g[i].next)
{
int u = g[i].to;
if(g[i].cap && !vis[u]) dfs(u);
}
}
int main()
{
int n, m, a, b;
while(~ scanf("%d%d", &n, &m))
{
cnt = 0;
memset(head, -1, sizeof head);
ss = 0, tt = 2 * n + 1;
for(int i = 1; i <= n; i++) scanf("%d", &a), add_edge(i+n, tt, a);
for(int i = 1; i <= n; i++) scanf("%d", &a), add_edge(ss, i, a);
for(int i = 1; i <= m; i++) scanf("%d%d", &a, &b), add_edge(a, b+n, INF);
nv = tt + 1;
int ans = sap(ss, tt);
memset(vis, 0, sizeof vis);
dfs(ss);
int res = 0;
for(int i = 1; i <= n; i++)
{
if(vis[i] == false) res++;
if(vis[i+n] == true) res++;
}
printf("%d\n%d\n", ans, res);
for(int i = 1; i <= n; i++)
{
if(vis[i] == false) printf("%d -\n", i);
if(vis[i+n] == true) printf("%d +\n", i);
}
}
return 0;
}