题意:有N个点,M条边,现在要将K单位的物品从1运到N,在没条边上只能运ci个单位的物品,并且有一个花费系数
ai,即运送x单位花费x^2*ai。问在保证把所有物品运到N点情况下求花费最小,否则输出-1.
分析:明显的费用流,但是难点是花费是x^2*ai怎么建图。
刘汝佳《算法竞赛入门经典》P.366中讲到,用拆边法。一个费用系数为ai,两个物品通过的话可以拆成1*ai+3*ai,三个物品要通过拆成1*ai+3*ai+5*ai。由于c<=5,所以最多一条边可以拆成1ai,3ai,5ai,7ai,9ai。
要求的是最小费用流,如果这条边的流量为1,走的肯定是cost=1的那条边;如果流量为2,肯定走的是cost=1和cost=3那两条。以此类推。跑完最小费用流后,只需要比较汇点的总的流量值是否为k,若为k,输出答案,否则为-1.
#include<iostream>
#include<string>
#include<stdio.h>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
#define MAXN 1005
#define LL long long
#define INF 0x3f7f7f7f
const double eps = 1e-10;
struct Edge
{
int from,to,cap,flow,cost;
Edge(int from=0,int to=0,int cap=0,int flow=0,int cost=0)
{
this->from=from;
this->to=to;
this->cap=cap;
this->flow=flow;
this->cost=cost;
}
};
vector<Edge>edges;
vector<int>g[MAXN];
bool vis[MAXN];
int dis[MAXN];
int pre[MAXN];
int a[MAXN];
int s,t;
void init()
{
for(int i=0;i<MAXN;i++)
{
g[i].clear();
}
edges.clear();
}
void add(int from,int to,int cap,int cost)
{
edges.push_back(Edge(from,to,cap,0,cost));
edges.push_back(Edge(to,from,0,0,-cost));
int m=edges.size();
g[from].push_back(m-2);
g[to].push_back(m-1);
}
bool spfa(int &flow,int &cost)
{
int i;
for(i=0;i<MAXN;i++)
dis[i]=INF;
memset(vis,0,sizeof(vis));
queue<int>q;
q.push(s);
dis[s]=0;
vis[s]=1;
pre[s]=0;
a[s]=INF;
while(!q.empty())
{
int u=q.front();
q.pop();
vis[u]=0;
int sz=g[u].size();
for(i=0;i<sz;i++)
{
Edge &e=edges[g[u][i]];
if(e.cap>e.flow&&dis[e.to]>dis[u]+e.cost)
{
dis[e.to]=dis[u]+e.cost;
pre[e.to]=g[u][i];
a[e.to]=min(a[u],e.cap-e.flow);
if(!vis[e.to])
{
vis[e.to]=1;
q.push(e.to);
}
}
}
}
if(dis[t]==INF)
return false;
flow+=a[t];
cost+=dis[t]*a[t];
int v=t;
while(v!=s)
{
edges[pre[v]].flow+=a[t];
edges[pre[v]^1].flow-=a[t];
v=edges[pre[v]].from;
}
return true;
}
int n,m,k;
void minCost()
{
int flow=0,cost=0;
while(spfa(flow,cost));
//cout<<flow<<" "<<cost<<endl;
if(flow!=k)
{
puts("-1");return;
}
else printf("%d\n",cost);
}
int main()
{
int i,j;
while(scanf("%d%d%d",&n,&m,&k)!=EOF)
{
init();
s=0,t=n;
add(0,1,k,0);
for(i=1;i<=m;i++)
{
int u,v,ai,c;
scanf("%d%d%d%d",&u,&v,&ai,&c);
for(j=0;j<c;j++)
add(u,v,1,(2*j+1)*ai);
}
minCost();
}
return 0;
}