hdu 3667 费用流

费用与流量呈二次方关系   k^2= 1 + 3 + 5 +....+ (2*k-1) 以此拆边建图

#include <utility>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <set>
#include <vector>
#include <cmath>
#include <queue>
#include <bitset>
#include <map>
#include <iterator>
using namespace std;
#define clr(a,v) memset(a,v,sizeof(a))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int INF = 0x3f3f3f3f;
const int maxn = 128;
const int mask = 127;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int mod = 777777777;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
template<typename T>
inline T minx(T a,T b)
{
    return (a==-1||b<a)?b:a;
}
int head[maxn],E,q[maxn],front,rear;
bool inq[maxn];
int pre[maxn],cur[maxn],dis[maxn];
struct node
{
    int cap,cost,v,next;
    node(){}
    node(int cap,int cost,int v,int next):
        cap(cap),cost(cost),v(v),next(next){}
}edge[211111];
void add_edge(int u,int v,int c,int cc,int cost)
{
    edge[E]=node(c,cost,v,head[u]);
    head[u]=E++;
    edge[E]=node(cc,-cost,u,head[v]);
    head[v]=E++;
}
int spfa(int s,int t,int n)
{
    int i,u,v;
    for(i=0;i<=n;++i) dis[i]=INF;
    front=rear=0;
    dis[s]=0;
    pre[s]=s;
    cur[s]=-1;
    q[rear++]=s;
    while(front<rear)
    {
        u=q[(front++)&mask];
        inq[u]=false;
        for(i=head[u];~i;i=edge[i].next)
        {
            
            v=edge[i].v;
            //cout<<u<<" "<<v<<" "<<edge[i].cap<<endl;
            if(edge[i].cap>0&&dis[u]+edge[i].cost<dis[v])
            {
                dis[v]=dis[u]+edge[i].cost;
                pre[v]=u;
                cur[v]=i;
                if(!inq[v])
                {
                    inq[v]=true;
                    q[(rear++)&mask]=v;
                }
            }
        }
    }
    return dis[t];
}
int MinCost(int s,int t,int k,int n)
{
    int ans=0,u,v,cap,cost,flow=0;
    while(true)
    {
        cost=spfa(s,t,n);
        if(cost==INF) break;
        u=v=t;
        cap=-1;
        for(u=pre[u];v!=s;v=u,u=pre[u])
        {
            cap=minx(cap,edge[cur[v]].cap);
        }
        ans+=cost*cap;
        flow+=cap;
        u=v=t;
        for(u=pre[u];v!=s;v=u,u=pre[u])
        {
            edge[cur[v]].cap-=cap;
            edge[cur[v]^1].cap+=cap;
        }
    }
    //printf("flow %d\n",flow);
    return flow==k?ans:-1;
}
int main() {
    int n,m,k;
    int u,v,a,c,i,j;
    while(~scanf("%d%d%d",&n,&m,&k))
    {
        clr(head,-1);
        E=0;
        int s,t;
        s=0,t=n+1;
        add_edge(s,1,k,0,0);
        add_edge(n,t,k,0,0);
        for(i=0;i<m;++i)
        {
            scanf("%d%d%d%d",&u,&v,&a,&c);
            for(j=1;j<=c;++j)
            {
                add_edge(u,v,1,0,(j*2-1)*a);
            }
        }
        int ans=MinCost(s,t,k,t+1);
        printf("%d\n",ans);
    }
    return 0;
}