费用流模板

题意：

在一个篮球联赛里，有n支球队，球队的支出是和他们的胜负场次有关系的，具体来说，第i支球队的赛季总支出是Ci*x^2+Di*y^2，Di<=Ci。(赢得多，给球员的奖金就多嘛)

其中x,y分别表示这只球队本赛季的胜负场次。现在赛季进行到了一半，每只球队分别取得了a[i]场胜利和b[i]场失利。而接下来还有m场比赛要进行。问联盟球队的最小总支出是多少。

亲测起点和终点的距离较短时dijstra慢到爆炸

#include <bits/stdc++.h>
using namespace std;
typedef int lint;
typedef long long LL;
struct EDGE {
    int from, to, next, cost, cap;  //  如果需要修改 cost为LL
};
namespace MFMC {
    const static int maxn = 100011;
    const static int maxm = 500005;
    EDGE edge[maxm];
    int tot, he[maxn], n;
    void init(int _n) {
        tot = 0;
        n = _n + 1;
        memset(he, -1, n * sizeof(int));
    }
    void Add(int u, int v, int cap,int cost) {   //  如果需要修改 cost为LL
        edge[tot] = EDGE{u, v, he[u], cost, cap};
        he[u] = tot++;
    }
    void add(int u, int v, int cap,int cost) {  //  如果需要修改 cost为LL
        Add(u, v,  cap,cost);
        Add(v, u,  0,-cost);
    }
//O(VE)
//record_e[i]是fa[i]->i的边的编号
    template<typename DT>
    void spfa(int s, DT dist[], int rec[]) {
        queue<int> q;
        static bool inq[maxn];

        memset(dist, 0x3f, n * sizeof(DT));
        memset(inq, 0, n * sizeof(bool));
        memset(rec, -1, n * sizeof(int));
        q.push(s);
        dist[s] = 0;
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            inq[u] = 0;
            for (int e = he[u]; ~e; e = edge[e].next) {
                if (0 == edge[e].cap)
                    continue;
                int v = edge[e].to;
                if (dist[v] > dist[u] + edge[e].cost) {
                    dist[v] = dist[u] + edge[e].cost;
                    rec[v] = e;
                    if (!inq[v]) {
                        q.push(v);
                        inq[v] = 1;
                    }
                }
            }
        }
    }

    template<typename DT>
    void dijkstra(int s, DT dist[], int rec[]) {
        priority_queue<pair<DT, int> > q;//-dist, vertex

        memset(dist, 0x3f, n * sizeof(DT));
        memset(rec, -1, n * sizeof(int));
        dist[s] = 0;
        q.push(make_pair(0, s));
        while (!q.empty()) {
            s = q.top().second;
            DT c = -q.top().first;
            q.pop();
            if (c != dist[s]) continue;
            for (int e = he[s]; ~e; e = edge[e].next) {
                if (0 == edge[e].cap) continue;
                int v = edge[e].to;
                if (dist[v] > c + edge[e].cost) {
                    dist[v] = c + edge[e].cost;
                    rec[v] = e;
                    q.push(make_pair(-dist[v], v));
                }
            }
        }
    }

//Need dijkstra_GRAPH_EDGES_PQ
//O(FE log(E)),F is the maximum flow

    template<typename FT, typename CT>
    void mfmc(int s, int t, FT &maxflow, CT &mincost) {
        CT inf;
        memset(&inf, 0x3f, sizeof(CT));
        static CT dist[maxn];
        static int rec_e[maxn];
        maxflow = mincost = 0;
        CT realdist = 0;    //real distance from s to t

        bool first = true;
        while (1) {
            if (first) {
                spfa( s, dist, rec_e);
                first = false;
            } else {
                dijkstra( s, dist, rec_e);
            }
            if (inf == dist[t])
                break;
            FT minF = numeric_limits<FT>::max();
            for (int e = rec_e[t]; ~e; e = rec_e[edge[e].from])
                minF = min(minF, (FT) edge[e].cap);
            maxflow += minF;
            realdist += dist[t];
            mincost += minF * realdist;
            for (int e = rec_e[t]; ~e; e = rec_e[edge[e].from]) {
                edge[e].cap -= minF;
                edge[e ^ 1].cap += minF;
            }
            for (int e = 0; e < tot; ++e) {
                EDGE &ed = edge[e];
                ed.cost += dist[ed.from] - dist[ed.to];
            }
        }
    }
};
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int win[5005],lose[5005],C[5005],D[5005],in[6005];
int main(){
    int n=read();int m=read();int T=n+m+1;
    MFMC::init(T);
    for(int i=1;i<=n;i++)
        win[i]=read(),lose[i]=read(),C[i]=read(),D[i]=read();
    for(int i=1;i<=m;i++)
    {
        MFMC::add(0,i,1,0);
        int u=read(),v=read();
        MFMC::add(i,m+u,1,0);
        MFMC::add(i,m+v,1,0);
        in[u]++;in[v]++;
    }
    for(int i=1;i<=n;i++)
        lose[i]+=in[i];
    int ans = 0;
    for(int i=1;i<=n;i++)
        ans+=win[i]*win[i]*C[i]+lose[i]*lose[i]*D[i];
    for(int i=1;i<=n;i++)
        for(int j=1;j<=in[i];j++)
        {
            MFMC::add(m+i,T,1,2*C[i]*win[i]+C[i]+D[i]-2*D[i]*lose[i]);
            lose[i]--;win[i]++;
        }
    int cost = 0,flow = 0;
    MFMC::mfmc( 0,T,flow,cost );
    printf("%d\n",ans+cost);
    return 0;
}