先跑最大流,然后在残量网络上跑最小费用最大流。
/* Think Thank Thunk */
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1005, maxm = 20005, maxq = 100000, inf = 0x3f3f3f3f;
int n, m, k, cur[maxn], head[maxn], cnt, bg, ed, depth[maxn], way[maxn], q[maxq];
bool vis[maxn];
struct _edge {
int v, w, c, next;
} g[maxm << 1];
struct edge {
int u, v, w, c;
} e[maxm << 1];
inline int iread() {
int f = 1, x = 0; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
return f * x;
}
inline void add(int u, int v, int w, int c) {
g[cnt] = (_edge){v, w, c, head[u]};
head[u] = cnt++;
}
inline void insert(int u, int v, int w, int c) {
add(u, v, w, c); add(v, u, 0, -c);
}
inline bool bfs() {
for(int i = 0; i <= n; i++) depth[i] = -1;
int h = 0, t = 0, u, i; depth[q[t++] = bg] = 0;
while(h != t) for(i = head[u = q[h++]]; ~i; i = g[i].next) if(g[i].w && !~depth[g[i].v]) {
depth[g[i].v] = depth[u] + 1;
if(g[i].v == ed) return 1;
q[t++] = g[i].v;
}
return 0;
}
inline int dfs(int x, int flow) {
if(x == ed) return flow;
int left = flow;
for(int i = cur[x]; ~i; i = g[i].next) if(g[i].w && depth[g[i].v] == depth[x] + 1) {
int tmp = dfs(g[i].v, min(left, g[i].w));
left -= tmp; g[i].w -= tmp; g[i ^ 1].w += tmp;
if(g[i].w) cur[x] = i;
if(!left) return flow;
}
if(left == flow) depth[x] = -1;
return flow - left;
}
inline bool spfa() {
for(int i = 0; i <= n; i++) depth[i] = inf;
int h = 0, t = 0, u, i; depth[q[t++] = bg] = 0;
while(h != t) for(i = head[u = q[h++]], vis[u] = 0; ~i; i = g[i].next) if(g[i].w && depth[g[i].v] > depth[u] + g[i].c) {
depth[g[i].v] = depth[u] + g[i].c;
way[g[i].v] = i;
if(!vis[g[i].v]) vis[q[t++] = g[i].v] = 1;
}
return depth[ed] != inf;
}
inline int back() {
int flow = inf, res = 0;
for(int u = ed; u != bg; u = g[way[u] ^ 1].v) flow = min(flow, g[way[u]].w);
for(int u = ed; u != bg; u = g[way[u] ^ 1].v) g[way[u]].w -= flow, g[way[u] ^ 1].w += flow, res += flow * g[way[u]].c;
return res;
}
int main() {
n = iread(); m = iread(); k = iread(); bg = 1; ed = n;
for(int i = 0; i <= n; i++) head[i] = -1; cnt = 0;
for(int i = 1; i <= m; i++) {
e[i].u = iread(); e[i].v = iread(); e[i].w = iread(); e[i].c = iread();
insert(e[i].u, e[i].v, e[i].w, 0);
}
int ans = 0;
while(bfs()) {
for(int i = 0; i <= n; i++) cur[i] = head[i];
ans += dfs(bg, inf);
}
printf("%d ", ans);
ans = 0;
bg = 0; insert(bg, 1, k, 0);
for(int i = 1; i <= m; i++) insert(e[i].u, e[i].v, inf, e[i].c);
while(spfa()) ans += back();
printf("%d\n", ans);
return 0;
}