hdu 3667 拆边费用流

因为每条边的容量是c 穿过这条边的代价与流的平方成正比 cost=a*f*f

所以可以从u向v连c条边 每条边的流为1 代价为a 3a 5a （2*i-1）a   

跑一边最小费用流 代价就变成了流的平方

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
int sumFlow;
const int MAXN = 100010;
const int MAXM = 100100;
const int INF=0x7fffffff;
struct Edge
{
    int u,v,cap,cost,next;
}edge[MAXM];
int NE;
int head[MAXN],dist[MAXN],pp[MAXN];
bool vis[MAXN];
void init()
{
    NE=0;
    memset(head,-1,sizeof(head));
}
void ae(int u,int v,int cap,int cost)
{
    edge[NE].u=u;edge[NE].v=v;edge[NE].cap=cap;edge[NE].cost=cost;
    edge[NE].next=head[u];head[u]=NE++;

    edge[NE].u=v;edge[NE].v=u;edge[NE].cap=0;edge[NE].cost=-cost;
    edge[NE].next=head[v];head[v]=NE++;
}
bool SPFA(int s,int t,int n)
{
    int i,u,v;
    queue<int>q;
    memset(vis,0,sizeof(vis));
    memset(pp,-1,sizeof(pp));
    for(i=0;i<=n;i++) dist[i]=INF;
    vis[s]=1;dist[s]=0;
    q.push(s);
    while(!q.empty())
    {
        u=q.front();q.pop();vis[u]=0;
        for(i=head[u];i!=-1;i=edge[i].next)
        {
            v=edge[i].v;
            if(edge[i].cap&&dist[v]>dist[u]+edge[i].cost)
            {
                dist[v]=dist[u]+edge[i].cost;
                pp[v]=i;
                if(!vis[v])
                {
                    q.push(v);
                    vis[v]=1;
                }
            }
        }
    }
    if(dist[t]==INF) return 0;
    return 1;
}
pair<int,int> MCMF(int s,int t,int n)
{
    int flow=0,i,minflow,mincost=0;
    while(SPFA(s,t,n))
    {
        minflow=INF;
        for(i=pp[t];i!=-1;i=pp[edge[i].u])
            minflow=min(edge[i].cap,minflow);
        flow+=minflow;
        for(i=pp[t];i!=-1;i=pp[edge[i].u])
            edge[i].cap-=minflow,edge[i^1].cap+=minflow;
        mincost+=dist[t]*minflow;
    }
    return make_pair(flow,mincost);
}
int main()
{//freopen("C:\\Users\\Administrator\\Desktop\\input.txt","r",stdin);
    int n,m,u,v,c,k,a;
    while(scanf("%d%d%d",&n,&m,&k)!=EOF)
    {
        init();
        int vs=0,vt=n,NV=n+1;
        ae(vs,1,k,0);
        while(m--)
        {
            scanf("%d%d%d%d",&u,&v,&a,&c);
            for(int i=1;i<=c;i++)
            {
                ae(u,v,1,a*(i*2-1));
            }
        }
        pair<int,int>ans;
        ans=MCMF(vs,vt,NV);
        if(ans.first!=k) printf("-1\n");
        else printf("%d\n",ans.second);
    }
    return 0;
}