subcrip
/
cp-templates
1
0
Fork 0
Code

Add graph/bounded_mcmf.cc 

Signed-off-by: subcrip <contact@subc.rip>
This commit is contained in:
subcrip 2024-05-20 13:31:59 +08:00
parent 4e03e50bcc
commit 76d705f0a2
1 changed files with 39 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

39
graph/bounded_mcmf.cc Normal file
View File

@ -0,0 +1,39 @@
struct bounded_mcmf {
int n, m, S, T;
mcmf net;
ll sum;
vector<ll> fl;
vector<ll> init;
bounded_mcmf(int n, int m) : sum(0), n(n), m(m), S(0), T(n + 1), net(n + 1), fl(m), init(n + 1) {}
void add_edge(int from, int to, ll low, ll high, ll cost, int edge_id = -1) {
if (edge_id != -1) {
fl[edge_id] += low;
}
net.add_edge(from, to, high - low, cost, edge_id, -1);
init[to] += low, init[from] -= low;
}
optional<tuple<ll, ll, vector<ll>>> run(int s, int t) {
for (int i = 1; i <= n; ++i) {
if (init[i] > 0) {
net.add_edge(S, i, init[i], 0, -1, -1);
sum += init[i];
} else if (init[i] < 0) {
net.add_edge(i, T, -init[i], 0, -1, -1);
}
}
net.add_edge(t, s, INFLL, 0, -1, -1);
if (sum != net.run(S, T).first) {
return nullopt;
} else {
auto [res_flow, res_cost] = net.run(s, t);
for (int from = 1; from <= n; ++from) {
for (auto&& [to, cap, flow, cost, rev, mark] : net.edges[from]) {
if (mark != -1) {
fl[mark] = flow;
}
}
}
return {{res_flow, res_cost, fl}};
}
}
};