subcrip
/
dotfiles
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

regular backup

This commit is contained in:
arielherself 2024-09-18 14:45:51 +08:00
parent d6a51ead4c
commit ab66d960dc
Signed by: arielherself
SSH Key Fingerprint: SHA256:AK3cyo9tFsp7Mox7K0sYphleC8hReXhnRKxwuDT5LBc
2 changed files with 8 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
nvim/lua/snippets/bounded-mcmf.lua
View File

@ -2,11 +2,11 @@ return [=[
struct bounded_mcmf { struct bounded_mcmf {
int n, m, S, T; int n, m, S, T;
mcmf net; mcmf net;
ll sum; ll sum, pre;
vector<ll> fl; vector<ll> fl;
vector<ll> init; vector<ll> init;
vector<ll> costs; vector<ll> costs;
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), costs(m) {} bounded_mcmf(int n, int m) : sum(0), pre(0), n(n), m(m), S(0), T(n + 1), net(n + 1), fl(m), init(n + 1), costs(m) {}
// handle negative loop case // handle negative loop case
void add_edge(int from, int to, ll low, ll high, ll cost, int edge_id = -1) { void add_edge(int from, int to, ll low, ll high, ll cost, int edge_id = -1) {
if (cost < 0) { if (cost < 0) {
@ -27,6 +27,7 @@ struct bounded_mcmf {
void __add_edge(int from, int to, ll low, ll high, ll cost, int edge_id = -1) { void __add_edge(int from, int to, ll low, ll high, ll cost, int edge_id = -1) {
net.add_edge(from, to, high - low, cost, edge_id, -1); net.add_edge(from, to, high - low, cost, edge_id, -1);
init[to] += low, init[from] -= low; init[to] += low, init[from] -= low;
pre += low * cost;
} }
void prep(int s, int t) { void prep(int s, int t) {
for (int i = 1; i <= n; ++i) { for (int i = 1; i <= n; ++i) {
@ -57,6 +58,7 @@ struct bounded_mcmf {
} }
} }
} }
res_cost += pre;
return {{res_flow, res_cost, fl}}; return {{res_flow, res_cost, fl}};
} }
} }
@ -64,6 +66,7 @@ struct bounded_mcmf {
optional<tuple<ll, ll, vector<ll>>> run_mcf(int s, int t) { optional<tuple<ll, ll, vector<ll>>> run_mcf(int s, int t) {
prep(s, t); prep(s, t);
auto [res_flow, res_cost] = net.run(S, T); auto [res_flow, res_cost] = net.run(S, T);
res_cost += pre;
if (sum != res_flow) { if (sum != res_flow) {
return nullopt; return nullopt;
} else { } else {

4
nvim/lua/snippets/hld.lua
View File

@ -69,9 +69,10 @@ struct HLD {
swap(u, v); swap(u, v);
} }
tr.range_apply(info[info[u].head].dfn, info[u].dfn, t); tr.range_apply(info[info[u].head].dfn, info[u].dfn, t);
u = info[info[u].head].father;
} }
if (info[u].depth < info[v].depth) swap(u, v); if (info[u].depth < info[v].depth) swap(u, v);
tr.range_apply(info[v].dfn, info[u].dfn); tr.range_apply(info[v].dfn, info[u].dfn, t);
} }
Info path_query(int u, int v) { Info path_query(int u, int v) {
@ -81,6 +82,7 @@ struct HLD {
swap(u, v); swap(u, v);
} }
res = res + tr.range_query(info[info[u].head].dfn, info[u].dfn); res = res + tr.range_query(info[info[u].head].dfn, info[u].dfn);
u = info[info[u].head].father;
} }
if (info[u].depth < info[v].depth) swap(u, v); if (info[u].depth < info[v].depth) swap(u, v);
res = res + tr.range_query(info[v].dfn, info[u].dfn); res = res + tr.range_query(info[v].dfn, info[u].dfn);