// ライブラリ整備用提出 #pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" // define macro "/D__MAI" using namespace std; typedef long long int ll; #define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__) #define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout< ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout< ostream& operator <<(ostream &o, const pair p) { o << "(" << p.first << ":" << p.second << ")"; return o; } template inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); } template inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); } template T& maxset(T& to, const T& val) { return to = max(to, val); } template T& minset(T& to, const T& val) { return to = min(to, val); } mt19937_64 randdev(8901016); inline ll rand_range(ll l, ll h) { return uniform_int_distribution(l, h)(randdev); } #ifdef __MAI #define getchar_unlocked getchar #define putchar_unlocked putchar #endif #ifdef __VSCC #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #endif namespace { #define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E) class MaiScanner { public: template void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'>(int& var) { input_integer(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getchar_unlocked(); for (; !isvisiblechar(cc); cc = getchar_unlocked()); for (; isvisiblechar(cc); cc = getchar_unlocked()) var.push_back(cc); return *this; } template void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; } MaiScanner scanner; class Flow { public: typedef int cap_t; size_t n; struct Arrow { int from, to; int left; cap_t cap; Arrow(int from = 0, int to = 0, cap_t w = 1) :from(from), to(to), left(w), cap(w) {} bool operator<(const Arrow& a) const { return (left != a.left) ? left < a.left : (left> vertex_to; vector> vertex_from; vector arrow; Flow(int n, int m = 5010) :n(n), vertex_to(n), vertex_from(n) { arrow.reserve(m); } void connect(int from, int to, cap_t left) { vertex_to[from].push_back(arrow.size()); // toto vertex_from[to].push_back(arrow.size()); // fromfrom arrow.emplace_back(from, to, left); } size_t degree(int v) { return vertex_to[v].size() + vertex_from[v].size(); } size_t degree_in(int v) { return vertex_from[v].size(); } size_t degree_out(int v) { return vertex_to[v].size(); } }; // ------------------------------------------------------------------- // dinic maxflow // ------------------------------------------------------------------- // http://tubo28.me/algorithm/dinic/ // http://topcoder.g.hatena.ne.jp/Mi_Sawa/20140311 // flowは書き換えられる. void dinic(Flow &flow, vector& result, int i_source, int i_sink) { assert(i_source != i_sink); static function& , vector&, const vector&, int, int, int)> dfs = [&](Flow& flow, vector& result, vector& flag, const vector& dist, int u, int i_sink, int mini) { // DAG // TODO: 経路再利用 if (i_sink == u) return mini; if (flag[u]) return -1; flag[u] = true; int sumw = 0; bool term = true; for (int e : flow.vertex_to[u]) { Flow::Arrow& a = flow.arrow[e]; if (a.left > 0 && dist[u]>dist[a.to]) { int w; if (mini < 0) w = a.left; else w = min(a.left, mini); w = dfs(flow, result, flag, dist, a.to, i_sink, w); if (w == -1) continue; a.left -= w; result[a.to] += w; sumw += w; mini -= w; term = false; flag[u] = false; // TODO: 末尾では? if (mini == 0) return term ? -1 : sumw; } } for (int e : flow.vertex_from[u]) { Flow::Arrow& a = flow.arrow[e]; if (a.cap>a.left && dist[u]>dist[a.from]) { int w; if (mini < 0) w = a.cap - a.left; else w = min(a.cap - a.left, mini); w = dfs(flow, result, flag, dist, a.from, i_sink, w); if (w == -1) continue; a.left += w; result[a.to] -= w; sumw += w; mini -= w; term = false; flag[u] = false; if (mini == 0) return term ? -1 : sumw; } } return term ? -1 : sumw; }; result.resize(flow.n); vector dist(flow.n); queue q; vector flag(flow.n); for (int distbegin = 0; ; distbegin += flow.n) { q.emplace(i_sink); // bfsはsinkからsourceへの距離を計算. dist[i_sink] = distbegin + 1; while (!q.empty()) { int v = q.front(); q.pop(); for (int ie : flow.vertex_from[v]) { const auto edge = flow.arrow[ie]; if (0 < edge.left && dist[edge.from] <= distbegin) { dist[edge.from] = dist[v] + 1; q.emplace(edge.from); } } for (int ie : flow.vertex_to[v]) { const auto edge = flow.arrow[ie]; if (edge.left < edge.cap && dist[edge.to] <= distbegin) { dist[edge.to] = dist[v] + 1; q.emplace(edge.to); } } } fill(flag.begin(), flag.end(), false); if (dist[i_source] <= distbegin) break; else result[i_source] += dfs(flow, result, flag, dist, i_source, i_sink, -1); } } class BipartiteMatching { public: Flow flow; int n, m; int ss; BipartiteMatching(int n, int m) :flow(2 + n + m), n(n), m(m), ss(n + m) { for (int i = 0; i& result) { int count = 0; vector r; dinic(flow, r, ss, ss + 1); for (Flow::Arrow& a : flow.arrow) { if (a.from == ss || a.to == ss + 1) continue; if (a.left == 0) { result.insert(a); count++; } } return count; } }; // ============================================================= // https://yukicoder.me/submissions/144370 // ============================================================= int width, height; int m, n; string cho[55]; int main() { int i, j, k; int x, y, a, b; cin >> height >> width; n = height*width; BipartiteMatching bm(n, n); for (y = 0; y> cho[y]; } int white, black; white = black = 0; for (y = 0; y x && cho[y][x + 1] != '.') bm.connect(x + y*width, x + 1 + y*width); if (height - 1 > y && cho[y + 1][x] != '.') bm.connect(x + y*width, x + (y + 1)*width); } } set pairs; bm.solve_dinic(pairs); int np = pairs.size(); white -= np; black -= np; cout << ((np * 100) + (min(white, black) * 10) + abs(white - black)) << endl; return 0; }