最小费用最大流

#include<bits/stdc++.h>
#define maxm 50000
#define inf 1e8
using namespace std;
const int maxn = 200;
const double eps = 1e-7;
const float EXP = exp(1.0);

int num, head[maxn];    ///邻接表头结点
struct EDGE
{
    int u, v, flow, next;
    double cost;
    EDGE() {}
    EDGE(int u, int v, int flow,double cost, int next): u(u), v(v), flow(flow),cost(cost), next(next) {}
} E[maxm];
int n,m;
int S[maxn],B[maxn]; ///每个点的人数S，饭B
void init()          ///初始化
{
    num = 0;
    memset(head, -1, sizeof head);
}
void add(int u, int v, int flow, double cost)
{
    E[num] = EDGE(u, v, flow, cost, head[u]);
    head[u] = num++;
    E[num] = EDGE(v, u, 0, -cost, head[v]);
    head[v] = num++;
}
int pre[maxn], mi[maxn];
double dis[maxn];
bool inq[maxn];
int s, t;            ///源点汇点
double ans;
int flow;
int que[maxn];
bool spfa()          ///火山哥给的模版，挺快的，我只会用
{
    for(int i = 0; i <=t; i++)
        inq[i] = 0, dis[i] = inf,pre[i]=-1;
    dis[s] = 0, mi[s] = inf, inq[s] = 1;
    int l = 0, r = 1;
    que[l] = s;
    while(l != r)
    {
        int u = que[l++];
        if(l == maxn) l =0;
        inq[u] = 0;
        for(int i = head[u]; i + 1; i = E[i].next)
        {
            int v = E[i].v;
            if(E[i].flow && dis[v] > dis[u] + E[i].cost+eps)
            {
                dis[v] = dis[u] + E[i].cost;
                pre[v] = i;
                mi[v] = min(mi[u], E[i].flow);
                if(!inq[v])
                {
                    inq[v] = 1;
                    que[r++] = v;
                    if(r >= maxn) r -= maxn;
                }
            }
        }
    }
    if(pre[t]==-1) return false;
    flow += mi[t];
    ans += mi[t] * dis[t];
    int u = t;
    for(int i = pre[u]; i + 1; i = pre[E[i].u])
    {
        E[i].flow -= mi[t];
        E[i ^ 1].flow += mi[t];
    }
    return true;
}
double Mincost()
{
    ans = 0, flow = 0;
    while(spfa());
    return ans;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        init();
        s=0,t=n+1;
        for (int i=1; i<=n ; i++ )
        {
            int a,b;
            scanf("%d%d",&a,&b);
            int x=min(a,b);
            a-=x,b-=x;
            if(a>0) add(0,i,a,0);
            else if(b>0) add(i,n+1,b,0);
        }
        for (int i=1; i<=m ; i++ )
        {
            int u,v,cap;
            double cost;
            scanf("%d%d%d%lf",&u,&v,&cap,&cost);
            if(cap>0)add(u,v,1,0);
            if(cap-1>0)add(u,v,cap-1,-1*log(1.0-cost));
        }
        Mincost();
        printf("%.2f\n",1.0-exp(-1.0*ans));
    }
    return 0;
}