1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123 | #include<bits/stdc++.h>
using namespace std;
using i64 = long long;
const int INF = 1e9;
const i64 INFL = 1e18;
namespace MCMF{
const int MAXN = 1e5 + 3;
const int MAXM = 2e5 + 3;
int H[MAXN], V[MAXM], N[MAXM], W[MAXM], F[MAXM], o = 1, n;
void add0(int u, int v, int f, int c){
V[++ o] = v, N[o] = H[u], H[u] = o, F[o] = f, W[o] = c;
V[++ o] = u, N[o] = H[v], H[v] = o, F[o] = 0, W[o] = -c;
n = max(n, u);
n = max(n, v);
}
bool I[MAXN];
i64 D[MAXN];
bool spfa(int s, int t){
queue <int> Q;
Q.push(s), I[s] = true;
for(int i = 1;i <= n;++ i)
D[i] = INFL;
D[s] = 0;
while(!Q.empty()){
int u = Q.front(); Q.pop(), I[u] = false;
for(int i = H[u];i;i = N[i]){
const int &v = V[i];
const int &f = F[i];
const int &w = W[i];
if(f && D[u] + w < D[v]){
D[v] = D[u] + w;
if(!I[v]) Q.push(v), I[v] = true;
}
}
}
return D[t] != INFL;
}
int C[MAXN]; bool T[MAXN];
pair<i64, i64> dfs(int s, int t, int u, i64 maxf){
if(u == t)
return make_pair(maxf, 0);
i64 totf = 0;
i64 totc = 0;
T[u] = true;
for(int &i = C[u];i;i = N[i]){
const int &v = V[i];
const int &f = F[i];
const int &w = W[i];
if(f && D[v] == D[u] + w && !T[v]){
auto p = dfs(s, t, v, min(1ll * F[i], maxf));
i64 f = p.first;
i64 c = p.second;
F[i ] -= f;
F[i ^ 1] += f;
totf += f;
totc += 1ll * f * W[i] + c;
maxf -= f;
if(maxf == 0){
T[u] = false;
return make_pair(totf, totc);
}
}
}
T[u] = false;
return make_pair(totf, totc);
}
pair<i64, i64> mcmf(int s, int t){
i64 ans1 = 0;
i64 ans2 = 0;
pair<i64, i64> r;
while(spfa(s, t)){
memcpy(C, H, sizeof(H));
r = dfs(s, t, s, INFL);
ans1 += r.first;
ans2 += r.second;
}
return make_pair(ans1, ans2);
}
i64 cost0;
int G[MAXN];
void add(int u, int v, int l, int r, int c){
G[v] += l;
G[u] -= l;
cost0 += 1ll * l * c;
add0(u, v, r - l, c);
}
i64 solve(){
int s = ++ n;
int t = ++ n;
i64 sum = 0;
for(int i = 1;i <= n - 2;++ i){
if(G[i] < 0)
add0(i, t, -G[i], 0);
else
add0(s, i, G[i], 0), sum += G[i];
}
auto res = mcmf(s, t);
if(res.first != sum)
return -1;
return res.second + cost0;
}
i64 solve(int s0, int t0){
add0(t0, s0, INF, 0);
int s = ++ n;
int t = ++ n;
i64 sum = 0;
for(int i = 1;i <= n - 2;++ i){
if(G[i] < 0)
add0(i, t, -G[i], 0);
else
add0(s, i, G[i], 0), sum += G[i];
}
auto res = mcmf(s, t);
if(res.first != sum)
return -1;
return res.second + cost0;
}
}
// ===== TEST =====
int qread();
int main(){
return 0;
}
|