HDU 4067 Random Maze（费用流）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4067

 

题意：给出一张有向图，需要在图中删除一些边满足一下条件：图只有一个起点s和终点t，对起点而言有入度 = 出度 - 1，终点则相反，其他点满足入度 == 出度，对于每条边选择保留或者删除都需要一定花费，问最终构成一张这样的图所需的最小花费

 

思路：考虑一个贪心的想法，对于每条边保留费用为a删除费用为b，如果有a <= b，则优先保留这条边，并记录两点的入度出度差，然后建费用流的边(v, u, 1, b - a)，代表删除该边所需费用，a > b时则相反处理（不需更新出入度，因为该边处于删除状态），为使s, t满足条件，故使in[s]++, in[t]--这样所有点就能保持流量平衡了，最后再虚拟源点汇点，对于那些入度 > 出度即in[i] > 0的点源点向其连边(ss, i, in[i], 0)，in[i] < 0的点连边至汇点(i, tt, -in[i], 0)，最终判断能否满流

 

 

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <climits>
#include <functional>
#include <deque>
#include <ctime>
#include <string>

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#pragma comment(linker, "/STACK:102400000,102400000")

using namespace std;

const int MAXN = 1000;
const int MAXM = 50000;
const int INF = 0x3f3f3f3f;

typedef long long ll;

struct Edge
{
    int to, next, cap, flow, cost;
} edge[MAXM];

int head[MAXN], tol;
int pre[MAXN], dis[MAXN];
bool vis[MAXN];
int N;//节点总个数，节点编号从0~N-1

void init(int n)
{
    N = n;
    tol = 0;
    memset(head, -1, sizeof(head));
}

void addedge(int u, int v, int cap, int cost)
{
    edge[tol].to = v;
    edge[tol].cap = cap;
    edge[tol].cost = cost;
    edge[tol].flow = 0;
    edge[tol].next = head[u];
    head[u] = tol++;
    edge[tol].to = u;
    edge[tol].cap = 0;
    edge[tol].cost = -cost;
    edge[tol].flow = 0;
    edge[tol].next = head[v];
    head[v] = tol++;
}

bool spfa(int s, int t)
{
    queue<int>q;
    for (int i = 0; i < N; i++)
    {
        dis[i] = INF;
        vis[i] = false;
        pre[i] = -1;
    }
    dis[s] = 0;
    vis[s] = true;
    q.push(s);
    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        vis[u] = false;
        for (int i = head[u]; i != -1; i = edge[i].next)
        {
            int v = edge[i].to;
            if (edge[i].cap > edge[i].flow &&
                    dis[v] > dis[u] + edge[i].cost )
            {
                dis[v] = dis[u] + edge[i].cost;
                pre[v] = i;
                if (!vis[v])
                {
                    vis[v] = true;
                    q.push(v);
                }
            }
        }
    }
    if (pre[t] == -1) return false;
    else return true;
}

//返回的是最大流，cost存的是最小费用
int minCostMaxflow(int s, int t, int &cost)
{
    int flow = 0;
    cost = 0;
    while (spfa(s, t))
    {
        int Min = INF;
        for (int i = pre[t]; 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[t]; i != -1; i = pre[edge[i ^ 1].to])
        {
            edge[i].flow += Min;
            edge[i ^ 1].flow -= Min;
            cost += edge[i].cost * Min;
        }
        flow += Min;
    }
    return flow;
}

int in[MAXN], out[MAXN];

int main()
{
    int t;
    cin >> t;
    for (int ca = 1; ca <= t; ca++)
    {
        memset(in, 0, sizeof(in));
        memset(out, 0, sizeof(out));
        int sum = 0, cost;

        int n, m, s, t;
        cin >> n >> m >> s >> t;
        int ss = 0, tt = n + 1;
        init(tt + 1);

        int du = 0;
        in[s]++, in[t]--;
        for (int i = 0; i < m; i++)
        {
            int u, v, a, b;
            scanf("%d%d%d%d", &u, &v, &a, &b);
            sum += min(a, b);

            if (a <= b)
            {
                in[u]--, in[v]++;
                addedge(v, u, 1, b - a);
            }
            else
                addedge(u, v, 1, a - b);
        }

        for (int i = 1; i <= n; i++)
        {
            if (in[i] > 0) addedge(ss, i, in[i], 0);
            if (in[i] < 0)
            {
                addedge(i, tt, -in[i], 0);
                du -= in[i];
            }
        }

        printf("Case %d: ", ca);
        int flow = minCostMaxflow(ss, tt, cost);
        if (flow != du) puts("impossible");
        else
            cout << cost + sum << endl;
    }
    return 0;
}