昨天写这题时可能有点傻x 因为费用是和容量的平方有关,所以把每条边拆成Ci条边,每条边的容量都是1,费用是容量为x和容量为x-1的费用的差值即可。
#include <cstdio>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
#define inf 0x3f3f3f3f
#define N 110
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x*f;
}
int n,m,k,a[N],h[N],num=1,ans=0,dis[N],path[N],mxflow=0;
bool inq[N];
struct edge{
int to,next,w,c;
}data[51000];
inline void add(int x,int y,int w,int c){
data[++num].to=y;data[num].next=h[x];h[x]=num;data[num].w=w;data[num].c=c;
data[++num].to=x;data[num].next=h[y];h[y]=num;data[num].w=0;data[num].c=-c;
}
inline bool spfa(){
queue<int>q;memset(dis,inf,sizeof(dis));memset(path,0,sizeof(path));
q.push(0);dis[0]=0;inq[0]=1;
while(!q.empty()){
int x=q.front();q.pop();inq[x]=0;
for(int i=h[x];i;i=data[i].next){
int y=data[i].to;if(!data[i].w) continue;
if(dis[x]+data[i].c<dis[y]){
dis[y]=dis[x]+data[i].c;path[y]=i;
if(!inq[y]) inq[y]=1,q.push(y);
}
}
}return path[n];
}
int main(){
// freopen("a.in","r",stdin);
while(~scanf("%d%d%d",&n,&m,&k)){
int tot=0;num=1;memset(h,0,sizeof(h));mxflow=ans=0;add(0,1,k,0);
while(m--){
int x=read(),y=read(),v=read(),c=read();tot+=c;
for(int i=1;i<=c;++i) add(x,y,1,v*i*i-v*(i-1)*(i-1));
}if(tot<k){puts("-1");continue;}
while(spfa()){
int low=inf,now=n;
while(path[now]) low=min(low,data[path[now]].w),now=data[path[now]^1].to;
ans+=low*dis[n];mxflow+=low;now=n;
while(path[now]) data[path[now]].w-=low,data[path[now]^1].w+=low,now=data[path[now]^1].to;
}if(mxflow!=k) puts("-1");
else printf("%d\n",ans);
}
return 0;
}