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
| #include <cstdio>
#include <queue>
using namespace std;
int getint() {
int r = 0, k = 1; char c = getchar();
for (; c < '0' || c > '9'; c = getchar()) if (c == '-') k = -1;
for (; '0' <= c && c <= '9'; c = getchar()) r = r * 10 - '0' + c;
return r * k;
}
const int maxn = 105;
const int maxe = maxn*maxn+2*maxn+10;
const int maxnode = maxn*2+10;
int n, S, T;
struct edge_type {
int to, next, r, c;
} edge[maxe<<1];
int cnte = 1, h[maxnode];
void ins(int u, int v, int f, int c) {
edge[++cnte].to = v;
edge[cnte].r = f;
edge[cnte].c = c;
edge[cnte].next = h[u];
h[u] = cnte;
edge[++cnte].to = u;
edge[cnte].r = 0;
edge[cnte].c = -c;
edge[cnte].next = h[v];
h[v] = cnte;
}
queue<int> Q;
bool vis[maxnode];
int dis[maxnode], w[maxn][maxn], pre[maxnode];
int a[maxnode];
const int INF = 1<<30;
bool SPFA(int S, int T, int &flow, int &cost) {
while (!Q.empty()) Q.pop();
for (int i = S; i <= T; ++i) {
vis[i] = false;
dis[i] = INF;
}
vis[S] = true; dis[S] = 0; a[S] = INF; pre[S] = 0;
Q.push(S);
int now;
while (!Q.empty()) {
now = Q.front(); Q.pop(); vis[now] = false;
for (int i = h[now]; i; i = edge[i].next) {
if (edge[i].r && dis[edge[i].to] > dis[now] + edge[i].c) {
dis[edge[i].to] = dis[now] + edge[i].c;
a[edge[i].to] = min(a[now], edge[i].r);
pre[edge[i].to] = i;
if (!vis[edge[i].to]) {
vis[edge[i].to] = true;
Q.push(edge[i].to);
}
}
}
}
if (dis[T] == INF) return false;
flow += a[T];
cost += a[T] * dis[T];
for (now = T; now != S; now = edge[pre[now]^1].to) {
edge[pre[now]].r -= a[T];
edge[pre[now]^1].r += a[T];
}
return true;
}
int MCMF(int S, int T) {
int flow = 0, cost = 0;
while (SPFA(S, T, flow, cost));
return cost;
}
int main() {
n = getint();
S = 1; T = 2*n+2;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
w[i][j] = getint();
ins(i+1, j+n+1, 1, w[i][j]);
}
ins(S, i+1, 1, 0);
ins(i+n+1, T, 1, 0);
}
int ans = MCMF(S, T);
printf("%d\n", ans);
cnte = 1;
for (int i = S; i <= T; ++i) h[i] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
ins(i+1, j+n+1, 1, -w[i][j]);
}
ins(S, i+1, 1, 0);
ins(i+n+1, T, 1, 0);
}
ans = MCMF(S, T);
printf("%d", -ans);
}
|