点这里 |
---|
题意: n个点和m条有向边,要求运输k个货物,每条边都有一个费用a和容量c。要求将k个货物从点1运送到点n,如果不能将所有货物运送到则输出-1。如果能则输出最小费用,费用的计算为该条路径的流量的平方乘以每条边的总花费
。
题解: 肉眼可见的最小费用最大流问题,但问题在于,费用的计算不一样,需要是流量的平方。所以用到了拆边的办法。将一条流量为c的边,拆成c条流量为1的边,这样就能套模板了,但是费用呢?注意费用是流量的平方,即本来应该是a * c2 ,如果我们拆成c条边,那么第一条边的费用就应是1a;第二条边的费用补上第一条便的费用需要是22 a,所以第二条边的费用应该是3a;第三条边加上前面所有的费用需要是32 a,所以第三条边的费用应该是5a。至此,建模也就清晰了,可以套模板了。
#include<algorithm>
#include<iostream>
#include<cstring>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;
const int N = 210;
const int inf = 0x3f3f3f3f;
int n, m, k;
int inq[N], dis[N], pre[N], preve[N];
struct edge{
int to, cost, cap, rev; //rev用于记录反边的编号
edge(int a, int b, int c, int d){ to = a; cost = b; cap = c; rev = d;}
};
vector<edge> e[N];
void addedge(int u, int v, int cost, int cap){
e[u].push_back(edge(v, cost, cap, e[v].size()));
e[v].push_back(edge(u, -cost, 0, e[u].size() - 1)); //加反边
}
bool spfa(int s, int t, int cnt){
for(int i = 1; i <= cnt; i++){ pre[i] = -1; dis[i] = inf; inq[i] = 0;}
queue<int> Q;
Q.push(s); inq[s] = 1; dis[s] = 0;
while(!Q.empty()){
int u = Q.front(); Q.pop(); inq[u] = 0;
for(int i = 0; i < e[u].size(); i++)
if(e[u][i].cap > 0){
int v = e[u][i].to, cost = e[u][i].cost;
if(dis[v] > dis[u] + cost){
dis[v] = dis[u] + cost;
pre[v] = u, preve[v] = i;
if(!inq[v]){ inq[v] = 1; Q.push(v);}
}
}
}
return dis[t] != inf;
}
int mincost(int s, int t, int cnt){
int cost = 0, sumflow = 0;
while(spfa(s, t, cnt)){
int v = t, flow = inf;
while(pre[v] != -1){ //回溯整个最短路径
int u = pre[v], i = preve[v]; //u是v的前驱节点,u的第i个边连接v
flow = min(flow, e[u][i].cap);
v = u;
}
v = t;
while(pre[v] != -1){
int u = pre[v], i = preve[v];
e[u][i].cap -= flow;
e[v][e[u][i].rev].cap += flow; //反边更新残留容量
v = u;
}
if(sumflow + flow >= k){
cost += (k - sumflow) * (k - sumflow) * dis[t];
return cost;
}
cost += dis[t] * flow * flow; //费用累加
sumflow += flow;
}
if(sumflow < k) return -1;
return cost;
}
int main(){
while(~scanf("%d%d%d", &n, &m, &k)){
for(int i = 0; i < N; i++) e[i].clear();
for(int i = 1; i <= m; i++){
int u, v, w, f;
scanf("%d%d%d%d", &u, &v, &w, &f);
for(int j = 1; j <= f; j++) addedge(u, v, (2 * j - 1) * w, 1);
}
printf("%d\n", mincost(1, n, n));
}
return 0;
}