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
124
125
126
127
128
129
130
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define MAX_N 202
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define vll vector<ll>
#define vs vector<string>
#define usll unordered_set<ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
using namespace std;
ll n, source = 105, sink = 106;
vll adj[MAX_N];
ll path[MAX_N];
ll c(ll in, ll out, ll t, ll f) {
ll s = out - in;
if (s >= t) return 0ll;
return min((t - s) * (t - s), f);
}
bool bfs(ll u, ll v, vvll& cap, vvll& flo, vvll& cost) {
bool inc[MAX_N];
vll w(MAX_N, 987654321);
memset(path, 0, sizeof path);
memset(inc, 0, sizeof inc);
w[u] = 0;
inc[u] = true;
queue<ll> q;
q.push(u);
while (!q.empty()) {
auto n = q.front();
q.pop();
inc[n] = false;
for (auto &m : adj[n]) {
if (cap[n][m] - flo[n][m] > 0 and w[n] + cost[n][m] < w[m]) {
w[m] = w[n] + cost[n][m];
path[m] = n;
if (!inc[m]) {
inc[m] = true;
q.push(m);
}
}
}
}
return path[v] != 0;
}
ll solve(vvll& cap, vvll& flo, vvll& cost) {
ll res = 0, c = 0;
while (bfs(source, sink, cap, flo, cost)) {
ll v = sink, mi = INT_MAX;
while (source != v) {
ll u = path[v];
mi = min(mi, cap[u][v] - flo[u][v]);
v = u;
}
v = sink;
while (source != v) {
ll u = path[v];
res += mi * cost[u][v];
flo[u][v] += mi;
flo[v][u] -= mi;
v = u;
}
c++;
}
if(c != n) {
cout<<"-1";
exit(0);
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(6);
cin >> n;
ll in[MAX_N], out[MAX_N], t, f;
vvll cap(MAX_N, vll(MAX_N)), rcap(MAX_N, vll(MAX_N));
vvll flo(MAX_N, vll(MAX_N)), rflo(MAX_N, vll(MAX_N));
vvll cost(MAX_N, vll(MAX_N)), rcost(MAX_N, vll(MAX_N));
for (ll i = 0; i < n; i++) {
cin >> in[i];
adj[source].push_back(i + 1);
adj[i + 1].push_back(source);
rcap[source][i + 1] = cap[source][i + 1] = 1;
}
for (ll i = 0, gap = 51; i < n; i++) {
cin >> out[i];
adj[i + 1 + gap].push_back(sink);
adj[sink].push_back(i + 1 + gap);
rcap[i + 1 + gap][sink] = cap[i + 1 + gap][sink] = 1;
}
cin >> t >> f;
for (ll i = 0, gap = 51; i < n; i++)
for (ll j = 0; j < n; j++) {
if (in[i] >= out[j]) continue;
adj[i + 1].push_back(j + 1 + gap);
adj[j + 1 + gap].push_back(i + 1);
rcost[j + 1 + gap][i + 1] = cost[i + 1][j + 1 + gap] = c(in[i], out[j], t, f);
rcost[i + 1][j + 1 + gap] = cost[j + 1 + gap][i + 1] = -c(in[i], out[j], t, f);
rcap[i + 1][j + 1 + gap] = cap[i + 1][j + 1 + gap] = 1;
}
cout << solve(cap, flo, cost) << ' ' << -solve(rcap, rflo, rcost);
return 0;
}
|
