第一问裸最大流
第二问在附加源与源之间连流量为maxflow+k,费用为0的边,在原图每条边加上一条流量为正无穷,费用为给定费用的边,跑最小费用最大流
Code:
#include <cstdio>
#include <queue>
#include <cstring>
#include <bitset>
using namespace std;
queue<int> Q;
#define INF 0x7FFFFFFF
#define M 400001
struct E
{
int to, f, c, next, op;
}G1[M], G2[M];
bitset<M> vis;
int point1[M], point2[M], cnt1, cnt2, dis[M], n, m, k, S, T, prev[M], path[M], flow;
inline void add1(int u, int v, int f, int F)
{
cnt1++, G1[cnt1] = (E){v, f, 0, point1[u], cnt1+1}, point1[u] = cnt1;
cnt1++, G1[cnt1] = (E){u, F, 0, point1[v], cnt1-1}, point1[v] = cnt1;
}
inline bool bfs()
{
memset(dis, -1, sizeof(dis));
dis[S] = 0;
Q.push(S);
while (!Q.empty())
{
int u = Q.front();
Q.pop();
for (int i = point1[u];i;i = G1[i].next)
{
int v = G1[i].to;
if (G1[i].f > 0 && dis[v] == -1)
{
dis[v] = dis[u] + 1;
Q.push(v);
}
}
}
return dis[T] != -1;
}
inline int Dinic(int u, int F)
{
if (u == T)return F;
int f(0), temp;
for (int i = point1[u];i && F > f;i = G1[i].next)
{
if (G1[i].f && dis[G1[i].to] == dis[u] + 1)
{
int v = G1[i].to;
temp = Dinic(v, min(G1[i].f, F-f));
if (temp)
{
f += temp;
G1[i].f -= temp;
G1[G1[i].op].f += temp;
}
else
dis[v] = -1;
}
}
return f;
}
inline void add2(int u, int v, int f, int c)
{
cnt2++, G2[cnt2] = (E){v, f, c, point2[u], cnt2+1}, point2[u] = cnt2;
cnt2++, G2[cnt2] = (E){u, 0, -c, point2[v], cnt2-1}, point2[v] = cnt2;
}
inline bool spfa()
{
for (int i = S;i <= T; ++i)dis[i] = INF;
vis.reset();
dis[S] = 0;
prev[S] = -1;
vis[S] = 1;
Q.push(S);
while (!Q.empty())
{
int u = Q.front();
Q.pop();
for (int i = point2[u];i;i = G2[i].next)
{
int v = G2[i].to;
if (G2[i].f > 0 && dis[v] > dis[u] + G2[i].c)
{
dis[v] = dis[u] + G2[i].c;
prev[v] = u;
path[v] = i;
if (!vis[v])
{
vis[v] = 1;
Q.push(v);
}
}
}
vis[u] = 0;
}
return dis[T] != INF;
}
inline int argument()
{
int delta(INF), i, j, cost(0);
for (i = T;prev[i] != -1;i = prev[i])
{
j = path[i];
delta = min(delta, G2[j].f);
}
flow += delta;
for (i = T;prev[i] != -1;i = prev[i])
{
j = path[i];
G2[j].f -= delta;
G2[G2[j].op].f += delta;
cost += delta * G2[j].c;
}
return cost;
}
int main()
{
int i, u, v, f, c, res(0);
scanf("%d %d %d", &n, &m, &k);
for (i = 1;i <= m; ++i)
{
scanf("%d %d %d %d", &u, &v, &f, &c);
add1(u, v, f, 0);
add2(u, v, f, 0);
add2(u, v, INF, c);
}
S = 1, T = n;
while (bfs())
res += Dinic(S, INF);
printf("%d", res);
add2(0, 1, k+res, 0);
res = S = 0;
while (spfa())
res += argument();
printf(" %d\n", res);
}