题意:
给定一张有向图,每条边都有一个容量C和一个扩容费用W。这里扩容费用是指将容量扩大1所需的费用。求:
1. 在不扩容的情况下,1到N的最大流;
2. 将1到N的最大流增加K所需的最小扩容费用。
做法:
第一问是裸的最大流。
第二问考虑在第一问的残量网络上继续建图。
在原来每条边的基础上建一条容量为inf,费用为这条边的扩容费用的边。
然后再新建一个源点,和1号点连一条容量为k,费用为0的边。
当然原图的边的费用都是0.
然后对于新图跑一个最小费用最大流。
代码:
/*************************************************************
Problem: bzoj 1834 [ZJOI2010]network 网络扩容
User: fengyuan
Language: C++
Result: Accepted
Time: 84 ms
Memory: 2680 kb
Submit_Time: 2018-01-17 22:29:06
*************************************************************/
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<cctype>
#include<queue>
using namespace std;
typedef long long ll;
const int N = 1010, M = 50010;
const int inf = 1e9;
int n, m, k, cnt = 1, s, ans;//s新建源点
int head[N], w[M], vis[N], dis[N], pre[N];
struct edge {
int from, to, nxt, c, w, t;//c容量,w费用
}e[M];
inline void addedge(int x, int y, int c, int w) {
e[++ cnt].from = x; e[cnt].to = y; e[cnt].nxt = head[x];
e[cnt].c = c; e[cnt].w = w; head[x] = cnt;
}
inline bool bfs() {
queue<int> q; q.push(1); memset(vis, -1, sizeof vis); vis[1] = 1;
while(!q.empty()) {
int u = q.front(); q.pop();
for(int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to;
if(vis[v] == -1 && e[i].c) {
vis[v] = vis[u]+1;
q.push(v);
}
}
}
return vis[n] != -1;
}
inline int dfs(int u, int flow) {
if(u == n) return flow;
int used = 0, w;
for(int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to;
if(vis[v] == vis[u]+1 && e[i].c) {
w = dfs(v, min(e[i].c, flow-used));
e[i].c -= w; e[i^1].c += w; used += w;
if(used == flow) return used;
}
}
if(!used) vis[u] = -1;
return used;
}
inline int dinic() {
int ret = 0;
while(bfs()) ret += dfs(1, inf);
return ret;
}
inline void build_graph() {
int tmp = cnt;
for(int i = 2; i <= tmp; i += 2) {
addedge(e[i].from, e[i].to, inf, w[i/2]);
addedge(e[i].to, e[i].from, 0, -w[i/2]);
}
s = 0; addedge(s, 1, k, 0);
}
inline bool spfa() {
queue<int> q; q.push(s);
for(int i = 0; i <= n; i ++) dis[i] = inf; dis[s] = 0;
memset(vis, 0, sizeof vis); vis[s] = 1;
while(!q.empty()) {
int u = q.front(); q.pop(); vis[u] = 0;
for(int i = head[u]; i; i = e[i].nxt) {
int v = e[i].to;
if(e[i].c && dis[v] > dis[u] + e[i].w) {
dis[v] = dis[u] + e[i].w; pre[v] = i;
if(!vis[v]) { vis[v] = 1; q.push(v); }
}
}
}
if(dis[n] == inf) return 0;
ans += dis[n];
for(int t = n; t != s; ) {
int i = pre[t]; e[i].c --; e[i^1].c ++;
t = e[i].from;
}
return 1;
}
int main() {
//freopen("sample.in", "r", stdin);
scanf("%d%d%d", &n, &m, &k);
for(int i = 1; i <= m; i ++) {
int x, y, z;
scanf("%d%d%d%d", &x, &y, &z, &w[i]);
addedge(x, y, z, 0); addedge(y, x, 0, 0);
}
printf("%d ", dinic());
build_graph();
while(spfa());
printf("%d\n", ans);
return 0;
}