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
131
132
133
134
135
136
137
138
139
140
141
142
143
| #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 404
#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, gap = 123, blue = 1, green = 1, source = 301, sink = 302;
ll table[4][4] {{100,70,40,0},{70,50,30,0},{40,30,20,0},{0,0,0,0}};
ll matrix[11][11], id[11][11], path[MAX_N], cost[MAX_N][MAX_N], cap[MAX_N][MAX_N], flo[MAX_N][MAX_N];
vll adj[MAX_N];
ll cvt(char ch) {
if(ch == 'A') return 0;
if(ch == 'B') return 1;
if(ch == 'C') return 2;
return 3;
}
ll c(ll y1, ll x1, ll y2, ll x2) {
return table[matrix[y1][x1]][matrix[y2][x2]];
}
bool bfs(ll u, ll v) {
bool inc[MAX_N];
vll w(MAX_N, 987654321);
memset(path, 0, sizeof path);
memset(inc, 0, sizeof inc);
queue<ll> q;
q.push(u);
w[u] = 0;
inc[u] = true;
while(!q.empty()) {
ll 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() {
for(ll i = 0; i < n; i++) {
for(ll j = 0; j < n; j++) {
if((i + j) & 1) continue;
ll me = id[i][j];
ll dy[4]{-1,0,1,0}, dx[4]{0,1,0,-1};
for(ll k = 0; k < 4; k++) {
ll ny = i + dy[k], nx = j + dx[k];
if(0 <= ny and ny < n and 0 <= nx and nx < n) {
ll you = id[ny][nx];
cost[me][you] = -c(i,j,ny,nx);
cost[you][me] = c(i,j,ny,nx);
cap[me][you] = 1;
adj[me].push_back(you);
adj[you].push_back(me);
}
}
}
}
for(ll i = 1; i < blue; i++) {
adj[source].push_back(i);
adj[i].push_back(source);
cap[source][i] = 1;
}
for(ll i = 1; i < green; i++) {
adj[i + gap].push_back(sink);
adj[sink].push_back(i + gap);
cap[i + gap][sink] = 1;
}
ll res = 0;
while(bfs(source, sink)) {
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;
ll sum = 0;
while(source != v) {
ll u = path[v];
sum += mi * cost[u][v];
flo[u][v] += mi;
flo[v][u] -= mi;
v = u;
}
res += min(sum, 0ll);
}
return -res;
}
int main() {
cin>>n;
char ch;
for(ll i = 0; i < n; i++) {
for (ll j = 0; j < n; j++) {
cin >> ch;
matrix[i][j] = cvt(ch);
id[i][j] = ((i + j) & 1) ? green++ + gap : blue++;
}
}
cout<<solve()<<endl;
return 0;
}
|
