题意:给你一个n个点 m条边的有向图 给出两种操作 删除所有以i为入点的边 有一个花费 删除所有以i为出点的边 也有一个花费 问你要想删除所有边 最小花费是多少
思路:选择一个点 可以覆盖所有他的入边 也可以覆盖所有他的出边 这不就是二分图最小点权覆盖么 建图方法是 对于每个点拆成两个点 一个入点一个出点 将所有源点和所有出点连边 容量为删除出边的花费 将所有入点和汇点连边 容量为入边的花费 将原图所有边连起来 容量为INF 跑最大流即可
如果源点到点i连的边满流 则在残余网络里 i连出的边不通 代表 删除了以i点为出点的所有边 同样的从j到汇点也是这个道理
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
#define REP( i, a, b ) for( int i = a; i < b; i++ )
#define FOR( 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 = 200 + 10;
const int maxe = 12000 + 10;
const int INF = 1e9;
struct Edge{
int v, c, f;
int next;
Edge() {}
Edge(int v, int c, int f, int next) : v(v), c(c), f(f), next(next) {}
};
struct ISAP{
int n, s, t;
int num[maxn], cur[maxn], d[maxn], p[maxn];
int Head[maxn], cntE;
int Q[maxn], head, tail;
int cut[maxe], cutE, vis[maxn];
Edge edge[maxe];
void Init(int n){
this -> n = n;
cntE = cutE = 0;
CLR(Head, -1);
CLR(vis, 0);
}
void Add(int u, int v, int c){
edge[cntE] = Edge(v, c, 0, Head[u]);
Head[u] = cntE++;
edge[cntE] = Edge(u, 0, 0, Head[v]);
Head[v] = cntE++;
}
void Bfs(){
CLR(d, -1);
CLR(num, 0);
d[t] = 0;
head = tail = 0;
Q[tail++] = t;
num[0] = 1;
while(head != tail){
int u = Q[head++];
for(int i = Head[u]; ~i; i = edge[i].next){
Edge &e = edge[i];
if(~d[e.v]) continue;
d[e.v] = d[u] + 1;
Q[tail++] = e.v;
num[d[e.v]] ++;
}
}
}
int Maxflow(int s, int t){
this -> s = s;
this -> t = t;
CPY(cur, Head);
Bfs();
int flow = 0, u = p[s] = s;
while(d[s] < n){
if(u == t){
int f = INF, neck;
for(int i = s; i != t; i = edge[cur[i]].v){
if(f > edge[cur[i]].c - edge[cur[i]].f){
f = edge[cur[i]].c - edge[cur[i]].f;
neck = i;
}
}
for(int i = s; i != t; i = edge[cur[i]].v){
edge[cur[i]].f += f;
edge[cur[i]^1].f -= f;
}
flow += f;
u = neck;
}
int ok = 0;
for(int i = cur[u]; ~i; i = edge[i].next){
Edge &e = edge[i];
if(e.c > e.f && d[e.v] + 1 == d[u]){
ok = 1;
cur[u] = i;
p[e.v] = u;
u = e.v;
break;
}
}
if(!ok){
int m = n - 1;
if(--num[d[u]] == 0) break;
for(int i = Head[u]; ~i; i = edge[i].next){
Edge &e = edge[i];
if(e.c - e.f > 0 && m > d[e.v]){
cur[u] = i;
m = d[e.v];
}
}
++num[d[u] = m + 1];
u = p[u];
}
}
return flow;
}
void Dfs(int u){
vis[u] = 1;
for(int i = Head[u]; ~i; i = edge[i].next){
if(!vis[edge[i].v] && edge[i].f < edge[i].c)
Dfs(edge[i].v);
}
}
}solver;
int n, m, in[maxn], out[maxn];
void solve(){
int S = 0, T = 2 * n + 1, ans = 0;
solver.Init(T + 1);
FOR(i, 1, n) scanf("%d", &in[i]);
FOR(i, 1, n) scanf("%d", &out[i]);
FOR(i, 1, m){
int u, v;
scanf("%d%d", &u, &v);
solver.Add(u, v + n, INF);
}
FOR(i, 1, n){
solver.Add(S, i, out[i]);
solver.Add(i + n, T, in[i]);
}
printf("%d\n", solver.Maxflow(S, T));
solver.Dfs(S);
FOR(i, 1, n){
if(!solver.vis[i]) ans++;
if(solver.vis[i + n]) ans++;
}
printf("%d\n", ans);
FOR(i, 1, n){
if(!solver.vis[i]) printf("%d -\n", i);
if(solver.vis[i + n]) printf("%d +\n", i);
}
}
int main()
{
//freopen("in.txt", "r", stdin);
while(~scanf("%d%d", &n, &m)) solve();
return 0;
}