poj 2125 Destroying The Graph(最小点权覆盖集)

【题意】

给出一个有向图，定义两种操作：w+(i)删掉i点的所有入边w-(i)删掉i点的所有出边，每种

操作都有对应的花费，问删掉所有边的最小花费。

【解答】

建图方法:对于每个点i，拆点为i，i+n，对于入边，从i+n想汇点T连边，值为入边花费；对于出边，从S向i连边，权值为出边花费。m组相连的边（x,y），从x向y+n连边， 费用INF。求出最小割。

然后是计算删除的是哪些点。对于完成最小割后的图，从源点S进行dfs，如果能够访问到，标记。对于不能访问到的点，i<=n时，这个点的出边是属于割集的，即所求点，且为‘-’；如果i>n，表示该点为需要删除的边的点，

#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define L(i) i<<1
#define R(i) i<<1|1
#define INF  0x3f3f3f3f
#define pi acos(-1.0)
#define eps 1e-9
#define maxn 100100
#define MOD 1000000007

const int MAXN = 10010;
const int MAXM = 40010;
struct Edge
{
    int to,next;
    int cap,flow;
} edge[MAXM];
int tot,n,m;
int head[MAXN];
int gap[MAXN],dep[MAXN];
int pre[MAXN],cur[MAXN];

void init()
{
    tot = 0;
    memset(head,-1,sizeof(head));
}
void add_edge(int u,int v,int w,int rw = 0)
{
    edge[tot].to = v;
    edge[tot].cap = w;
    edge[tot].flow = 0;
    edge[tot].next = head[u];
    head[u] = tot++;
    edge[tot].to = u;
    edge[tot].cap = rw;
    edge[tot].flow = 0;
    edge[tot].next = head[v];
    head[v] = tot++;
}
int sap(int start,int en,int N)
{
    memset(gap,0,sizeof(gap));
    memset(dep,0,sizeof(dep));
    memcpy(cur,head,sizeof(head));
    int u = start;
    pre[u] = -1;
    gap[0] = N;
    int ans = 0;
    while(dep[start] < N)
    {
        if(u == en)
        {
            int Min = INF;
            for(int i = pre[u]; i != -1; i = pre[edge[i^1].to])
                if(Min > edge[i].cap - edge[i].flow)
                    Min = edge[i].cap - edge[i].flow;
            for(int i = pre[u]; i != -1; i = pre[edge[i^1].to])
            {
                edge[i].flow += Min;
                edge[i^1].flow -= Min;
            }
            u = start;
            ans += Min;
            continue;
        }
        int flag = 0;
        int v;
        for(int i = cur[u]; i != -1; i = edge[i].next)
        {
            v = edge[i].to;
            if(edge[i].cap - edge[i].flow > eps && dep[v]+1 == dep[u])
            {
                flag = 1;
                cur[u] = pre[v] = i;
                break;
            }
        }
        if(flag)
        {
            u = v;
            continue;
        }
        int Min = N;
        for(int i = head[u]; i != -1; i = edge[i].next)
            if(edge[i].cap - edge[i].flow > eps && dep[edge[i].to] < Min)
            {
                Min = dep[edge[i].to];
                cur[u] = i;
            }
        gap[dep[u]]--;
        if(!gap[dep[u]])
            return ans;
        dep[u] = Min + 1;
        gap[dep[u]]++;
        if(u != start)
            u = edge[pre[u]^1].to;
    }
    return ans;
}
int vis[510];
void dfs(int u)
{
    vis[u] = 1;
    for(int i = head[u]; i != -1; i = edge[i].next)
    {
        int v = edge[i].to;
        if(edge[i].cap > edge[i].flow && !vis[v])
            dfs(v);
    }
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int t,C = 1;
    //scanf("%d",&t);
    while(scanf("%d%d",&n,&m) != EOF)
    {
        init();
        for(int i = 1; i <= n; i++)
        {
            int x;
            scanf("%d",&x);
            add_edge(i+n,2*n+1,x);
        }
        for(int i = 1; i <= n; i++)
        {
            int x;
            scanf("%d",&x);
            add_edge(0,i,x);
        }
        while(m--)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            add_edge(x,y+n,INF);
        }
        printf("%d\n",sap(0,2*n+1,2*n+2));
        memset(vis,0,sizeof(vis));
        dfs(0);
        int cnt = 0;
        for(int i = 1; i <= n; i++)
            cnt += (!vis[i]) + vis[i+n];
        printf("%d\n",cnt);
        for(int i = 1; i <= n; i++)
        {
            if(!vis[i])
                printf("%d -\n",i);
            if(vis[i+n])
                printf("%d +\n",i);

        }
    }
    return 0;
}