#line 1 "library/my_template.hpp" #if defined(LOCAL) #include #else #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include using namespace std; using ll = long long; using u32 = unsigned int; using u64 = unsigned long long; using i128 = __int128; using u128 = unsigned __int128; using f128 = __float128; template constexpr T infty = 0; template <> constexpr int infty = 1'000'000'000; template <> constexpr ll infty = ll(infty) * infty * 2; template <> constexpr u32 infty = infty; template <> constexpr u64 infty = infty; template <> constexpr i128 infty = i128(infty) * infty; template <> constexpr double infty = infty; template <> constexpr long double infty = infty; using pi = pair; using vi = vector; template using vc = vector; template using vvc = vector>; template using vvvc = vector>; template using vvvvc = vector>; template using vvvvvc = vector>; template using pq = priority_queue; template using pqg = priority_queue, greater>; #define vv(type, name, h, ...) \ vector> name(h, vector(__VA_ARGS__)) #define vvv(type, name, h, w, ...) \ vector>> name( \ h, vector>(w, vector(__VA_ARGS__))) #define vvvv(type, name, a, b, c, ...) \ vector>>> name( \ a, vector>>( \ b, vector>(c, vector(__VA_ARGS__)))) // https://trap.jp/post/1224/ #define FOR1(a) for (ll _ = 0; _ < ll(a); ++_) #define FOR2(i, a) for (ll i = 0; i < ll(a); ++i) #define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i) #define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c)) #define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i) #define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i) #define overload4(a, b, c, d, e, ...) e #define overload3(a, b, c, d, ...) d #define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__) #define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__) #define FOR_subset(t, s) \ for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s))) #define all(x) x.begin(), x.end() #define len(x) ll(x.size()) #define elif else if #define eb emplace_back #define mp make_pair #define mt make_tuple #define fi first #define se second #define stoi stoll int popcnt(int x) { return __builtin_popcount(x); } int popcnt(u32 x) { return __builtin_popcount(x); } int popcnt(ll x) { return __builtin_popcountll(x); } int popcnt(u64 x) { return __builtin_popcountll(x); } int popcnt_mod_2(int x) { return __builtin_parity(x); } int popcnt_mod_2(u32 x) { return __builtin_parity(x); } int popcnt_mod_2(ll x) { return __builtin_parityll(x); } int popcnt_mod_2(u64 x) { return __builtin_parityll(x); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2) int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } // (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2) int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template T floor(T a, T b) { return a / b - (a % b && (a ^ b) < 0); } template T ceil(T x, T y) { return floor(x + y - 1, y); } template T bmod(T x, T y) { return x - y * floor(x, y); } template pair divmod(T x, T y) { T q = floor(x, y); return {q, x - q * y}; } template T SUM(const vector &A) { T sm = 0; for (auto &&a: A) sm += a; return sm; } #define MIN(v) *min_element(all(v)) #define MAX(v) *max_element(all(v)) #define LB(c, x) distance((c).begin(), lower_bound(all(c), (x))) #define UB(c, x) distance((c).begin(), upper_bound(all(c), (x))) #define UNIQUE(x) \ sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit() template T POP(deque &que) { T a = que.front(); que.pop_front(); return a; } template T POP(pq &que) { T a = que.top(); que.pop(); return a; } template T POP(pqg &que) { T a = que.top(); que.pop(); return a; } template T POP(vc &que) { T a = que.back(); que.pop_back(); return a; } template ll binary_search(F check, ll ok, ll ng, bool check_ok = true) { if (check_ok) assert(check(ok)); while (abs(ok - ng) > 1) { auto x = (ng + ok) / 2; (check(x) ? ok : ng) = x; } return ok; } template double binary_search_real(F check, double ok, double ng, int iter = 100) { FOR(iter) { double x = (ok + ng) / 2; (check(x) ? ok : ng) = x; } return (ok + ng) / 2; } template inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); } template inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); } // ? は -1 vc s_to_vi(const string &S, char first_char) { vc A(S.size()); FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); } return A; } template vector cumsum(vector &A, int off = 1) { int N = A.size(); vector B(N + 1); FOR(i, N) { B[i + 1] = B[i] + A[i]; } if (off == 0) B.erase(B.begin()); return B; } // stable sort template vector argsort(const vector &A) { vector ids(len(A)); iota(all(ids), 0); sort(all(ids), [&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); }); return ids; } // A[I[0]], A[I[1]], ... template vc rearrange(const vc &A, const vc &I) { vc B(len(I)); FOR(i, len(I)) B[i] = A[I[i]]; return B; } #endif #line 1 "library/other/io.hpp" // based on yosupo's fastio #include namespace fastio { #define FASTIO struct has_write_impl { template static auto check(T &&x) -> decltype(x.write(), std::true_type{}); template static auto check(...) -> std::false_type; }; template class has_write : public decltype(has_write_impl::check(std::declval())) { }; struct has_read_impl { template static auto check(T &&x) -> decltype(x.read(), std::true_type{}); template static auto check(...) -> std::false_type; }; template class has_read : public decltype(has_read_impl::check(std::declval())) {}; struct Scanner { FILE *fp; char line[(1 << 15) + 1]; size_t st = 0, ed = 0; void reread() { memmove(line, line + st, ed - st); ed -= st; st = 0; ed += fread(line + ed, 1, (1 << 15) - ed, fp); line[ed] = '\0'; } bool succ() { while (true) { if (st == ed) { reread(); if (st == ed) return false; } while (st != ed && isspace(line[st])) st++; if (st != ed) break; } if (ed - st <= 50) { bool sep = false; for (size_t i = st; i < ed; i++) { if (isspace(line[i])) { sep = true; break; } } if (!sep) reread(); } return true; } template ::value, int> = 0> bool read_single(T &ref) { if (!succ()) return false; while (true) { size_t sz = 0; while (st + sz < ed && !isspace(line[st + sz])) sz++; ref.append(line + st, sz); st += sz; if (!sz || st != ed) break; reread(); } return true; } template ::value, int> = 0> bool read_single(T &ref) { if (!succ()) return false; bool neg = false; if (line[st] == '-') { neg = true; st++; } ref = T(0); while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); } if (neg) ref = -ref; return true; } template ::value>::type * = nullptr> inline bool read_single(T &x) { x.read(); return true; } bool read_single(double &ref) { string s; if (!read_single(s)) return false; ref = std::stod(s); return true; } bool read_single(char &ref) { string s; if (!read_single(s) || s.size() != 1) return false; ref = s[0]; return true; } template bool read_single(vector &ref) { for (auto &d: ref) { if (!read_single(d)) return false; } return true; } template bool read_single(pair &p) { return (read_single(p.first) && read_single(p.second)); } template void read_single_tuple(T &t) { if constexpr (N < std::tuple_size::value) { auto &x = std::get(t); read_single(x); read_single_tuple(t); } } template bool read_single(tuple &tpl) { read_single_tuple(tpl); return true; } void read() {} template void read(H &h, T &... t) { bool f = read_single(h); assert(f); read(t...); } Scanner(FILE *fp) : fp(fp) {} }; struct Printer { Printer(FILE *_fp) : fp(_fp) {} ~Printer() { flush(); } static constexpr size_t SIZE = 1 << 15; FILE *fp; char line[SIZE], small[50]; size_t pos = 0; void flush() { fwrite(line, 1, pos, fp); pos = 0; } void write(const char val) { if (pos == SIZE) flush(); line[pos++] = val; } template ::value, int> = 0> void write(T val) { if (pos > (1 << 15) - 50) flush(); if (val == 0) { write('0'); return; } if (val < 0) { write('-'); val = -val; // todo min } size_t len = 0; while (val) { small[len++] = char(0x30 | (val % 10)); val /= 10; } for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; } pos += len; } void write(const string s) { for (char c: s) write(c); } void write(const char *s) { size_t len = strlen(s); for (size_t i = 0; i < len; i++) write(s[i]); } void write(const double x) { ostringstream oss; oss << fixed << setprecision(15) << x; string s = oss.str(); write(s); } void write(const long double x) { ostringstream oss; oss << fixed << setprecision(15) << x; string s = oss.str(); write(s); } template ::value>::type * = nullptr> inline void write(T x) { x.write(); } template void write(const vector val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } template void write(const pair val) { write(val.first); write(' '); write(val.second); } template void write_tuple(const T t) { if constexpr (N < std::tuple_size::value) { if constexpr (N > 0) { write(' '); } const auto x = std::get(t); write(x); write_tuple(t); } } template bool write(tuple tpl) { write_tuple(tpl); return true; } template void write(const array val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write(' '); write(val[i]); } } void write(i128 val) { string s; bool negative = 0; if (val < 0) { negative = 1; val = -val; } while (val) { s += '0' + int(val % 10); val /= 10; } if (negative) s += "-"; reverse(all(s)); if (len(s) == 0) s = "0"; write(s); } }; Scanner scanner = Scanner(stdin); Printer printer = Printer(stdout); void flush() { printer.flush(); } void print() { printer.write('\n'); } template void print(Head &&head, Tail &&... tail) { printer.write(head); if (sizeof...(Tail)) printer.write(' '); print(forward(tail)...); } void read() {} template void read(Head &head, Tail &... tail) { scanner.read(head); read(tail...); } } // namespace fastio using fastio::print; using fastio::flush; using fastio::read; #define INT(...) \ int __VA_ARGS__; \ read(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ read(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ read(__VA_ARGS__) #define CHAR(...) \ char __VA_ARGS__; \ read(__VA_ARGS__) #define DBL(...) \ double __VA_ARGS__; \ read(__VA_ARGS__) #define VEC(type, name, size) \ vector name(size); \ read(name) #define VV(type, name, h, w) \ vector> name(h, vector(w)); \ read(name) void YES(bool t = 1) { print(t ? "YES" : "NO"); } void NO(bool t = 1) { YES(!t); } void Yes(bool t = 1) { print(t ? "Yes" : "No"); } void No(bool t = 1) { Yes(!t); } void yes(bool t = 1) { print(t ? "yes" : "no"); } void no(bool t = 1) { yes(!t); } #line 3 "main.cpp" #line 2 "library/ds/my_bitset.hpp" // https://codeforces.com/contest/914/problem/F // https://yukicoder.me/problems/no/142 // わずかに普通の bitset より遅いときもあるようだが, // 固定長にしたくないときや slice 操作が必要なときに使う struct My_Bitset { using T = My_Bitset; int N; vc dat; // x で埋める My_Bitset(int N = 0, int x = 0) : N(N) { assert(x == 0 || x == 1); u64 v = (x == 0 ? 0 : -1); dat.assign((N + 63) >> 6, v); if (N) dat.back() >>= (64 * len(dat) - N); } int size() { return N; } void resize(int size) { dat.resize((size + 63) >> 6); int remainingBits = size & 63; if (remainingBits != 0) { u64 mask = (u64(1) << remainingBits) - 1; dat.back() &= mask; } N = size; } // thanks to chatgpt! class Proxy { public: Proxy(vc &d, int i) : dat(d), index(i) {} operator bool() const { return (dat[index >> 6] >> (index & 63)) & 1; } Proxy &operator=(u64 value) { dat[index >> 6] &= ~(u64(1) << (index & 63)); dat[index >> 6] |= (value & 1) << (index & 63); return *this; } void flip() { dat[index >> 6] ^= (u64(1) << (index & 63)); // XOR to flip the bit } private: vc &dat; int index; }; Proxy operator[](int i) { return Proxy(dat, i); } T &operator&=(const T &p) { assert(N == p.N); FOR(i, len(dat)) dat[i] &= p.dat[i]; return *this; } T &operator|=(const T &p) { assert(N == p.N); FOR(i, len(dat)) dat[i] |= p.dat[i]; return *this; } T &operator^=(const T &p) { assert(N == p.N); FOR(i, len(dat)) dat[i] ^= p.dat[i]; return *this; } T operator&(const T &p) const { return T(*this) &= p; } T operator|(const T &p) const { return T(*this) |= p; } T operator^(const T &p) const { return T(*this) ^= p; } int count() { int ans = 0; for (u64 val: dat) ans += popcnt(val); return ans; } int next(int i) { chmax(i, 0); if (i >= N) return N; int k = i >> 6; { u64 x = dat[k]; int s = i & 63; x = (x >> s) << s; if (x) return (k << 6) | lowbit(x); } FOR(idx, k + 1, len(dat)) { if (dat[idx] == 0) continue; return (idx << 6) | lowbit(dat[idx]); } return N; } int prev(int i) { chmin(i, N - 1); if (i <= -1) return -1; int k = i >> 6; if ((i & 63) < 63) { u64 x = dat[k]; x &= (u64(1) << ((i & 63) + 1)) - 1; if (x) return (k << 6) | topbit(x); --k; } FOR_R(idx, k + 1) { if (dat[idx] == 0) continue; return (idx << 6) | topbit(dat[idx]); } return -1; } My_Bitset range(int L, int R) { assert(L <= R); My_Bitset p(R - L); int rm = (R - L) & 63; FOR(rm) { p[R - L - 1] = bool((*this)[R - 1]); --R; } int n = (R - L) >> 6; int hi = L & 63; int lo = 64 - hi; int s = L >> 6; if (hi == 0) { FOR(i, n) { p.dat[i] ^= dat[s + i]; } } else { FOR(i, n) { p.dat[i] ^= (dat[s + i] >> hi) ^ (dat[s + i + 1] << lo); } } return p; } int count_range(int L, int R) { assert(L <= R); int cnt = 0; while ((L < R) && (L & 63)) cnt += (*this)[L++]; while ((L < R) && (R & 63)) cnt += (*this)[--R]; int l = L >> 6, r = R >> 6; FOR(i, l, r) cnt += popcnt(dat[i]); return cnt; } // [L,R) に p を代入 void assign_to_range(int L, int R, My_Bitset &p) { assert(p.N == R - L); int a = 0, b = p.N; while (L < R && (L & 63)) { (*this)[L++] = bool(p[a++]); } while (L < R && (R & 63)) { (*this)[--R] = bool(p[--b]); } // p[a:b] を [L:R] に int l = L >> 6, r = R >> 6; int s = a >> 6, t = b >> t; int n = r - l; if (!(a & 63)) { FOR(i, n) dat[l + i] = p.dat[s + i]; } else { int hi = a & 63; int lo = 64 - hi; FOR(i, n) dat[l + i] = (p.dat[s + i] >> hi) | (p.dat[1 + s + i] << lo); } } // [L,R) に p を xor void xor_to_range(int L, int R, My_Bitset &p) { assert(p.N == R - L); int a = 0, b = p.N; while (L < R && (L & 63)) { dat[L >> 6] ^= u64(p[a]) << (L & 63); ++a, ++L; } while (L < R && (R & 63)) { --b, --R; dat[R >> 6] ^= u64(p[b]) << (R & 63); } // p[a:b] を [L:R] に int l = L >> 6, r = R >> 6; int s = a >> 6, t = b >> t; int n = r - l; if (!(a & 63)) { FOR(i, n) dat[l + i] ^= p.dat[s + i]; } else { int hi = a & 63; int lo = 64 - hi; FOR(i, n) dat[l + i] ^= (p.dat[s + i] >> hi) | (p.dat[1 + s + i] << lo); } } // [L,R) に p を and void and_to_range(int L, int R, My_Bitset &p) { assert(p.N == R - L); int a = 0, b = p.N; while (L < R && (L & 63)) { if (!p[a++]) (*this)[L++] = 0; } while (L < R && (R & 63)) { if (!p[--b]) (*this)[--R] = 0; } // p[a:b] を [L:R] に int l = L >> 6, r = R >> 6; int s = a >> 6, t = b >> t; int n = r - l; if (!(a & 63)) { FOR(i, n) dat[l + i] &= p.dat[s + i]; } else { int hi = a & 63; int lo = 64 - hi; FOR(i, n) dat[l + i] &= (p.dat[s + i] >> hi) | (p.dat[1 + s + i] << lo); } } // [L,R) に p を or void or_to_range(int L, int R, My_Bitset &p) { assert(p.N == R - L); int a = 0, b = p.N; while (L < R && (L & 63)) { dat[L >> 6] |= u64(p[a]) << (L & 63); ++a, ++L; } while (L < R && (R & 63)) { --b, --R; dat[R >> 6] |= u64(p[b]) << (R & 63); } // p[a:b] を [L:R] に int l = L >> 6, r = R >> 6; int s = a >> 6, t = b >> t; int n = r - l; if (!(a & 63)) { FOR(i, n) dat[l + i] |= p.dat[s + i]; } else { int hi = a & 63; int lo = 64 - hi; FOR(i, n) dat[l + i] |= (p.dat[s + i] >> hi) | (p.dat[1 + s + i] << lo); } } string to_string() const { string S; FOR(i, N) S += '0' + (dat[i >> 6] >> (i & 63) & 1); return S; } // bitset に仕様を合わせる void set(int i) { (*this)[i] = 1; } void reset(int i) { (*this)[i] = 0; } void flip(int i) { (*this)[i].flip(); } void set() { fill(all(dat), u64(-1)); resize(N); } void reset() { fill(all(dat), 0); } int _Find_first() { return next(0); } int _Find_next(int p) { return next(p + 1); } }; #line 1 "library/flow/bipartite_dense.hpp" // vc で biadj matrix を渡す // N_1^2N_2/w. // (5000,5000) で 300ms 程度で動く場合がある // https://qoj.ac/problem/6308 // (10000?, 5000) 655ms // https://codeforces.com/contest/1045/problem/A // (10000, 20000) で 3837ms // https://codeforces.com/contest/786/problem/E template struct BipartiteMatching_Dense { int N1, N2; vc& adj; vc match_1, match_2; vc que; vc prev; BS vis; BipartiteMatching_Dense(vc& adj, int N1, int N2) : N1(N1), N2(N2), adj(adj), match_1(N1, -1), match_2(N2, -1) { vis = BS(N2, 1); FOR(s, N1) bfs(s); } void bfs(int s) { if (match_1[s] != -1) return; que.resize(N1), prev.resize(N1); int l = 0, r = 0; prev[s] = -1; vis.set(); que[r++] = s; while (l < r) { int u = que[l++]; BS cand = vis & adj[u]; for (int v = cand._Find_first(); v < N2; v = cand._Find_next(v)) { vis[v] = 0; if (match_2[v] != -1) { que[r++] = match_2[v]; prev[match_2[v]] = u; continue; } int a = u, b = v; while (a != -1) { int t = match_1[a]; match_1[a] = b, match_2[b] = a, a = prev[a], b = t; } return; } } return; } vc> matching() { vc> res; FOR(v, N1) if (match_1[v] != -1) res.eb(v, match_1[v]); return res; } pair, vc> vertex_cover() { vc que(N1); int l = 0, r = 0; vis.set(); vc done(N1); FOR(i, N1) { if (match_1[i] == -1) done[i] = 1, que[r++] = i; } while (l < r) { int a = que[l++]; BS cand = adj[a] & vis; for (int b = cand._Find_first(); b < N2; b = cand._Find_next(b)) { vis[b] = 0; int to = match_2[b]; assert(to != -1); if (!done[to]) done[to] = 1, que[r++] = to; } } vc left, right; FOR(i, N1) if (!done[i]) left.eb(i); FOR(i, N2) if (!vis[i]) right.eb(i); return {left, right}; } }; #line 6 "main.cpp" void solve() { INT(H, W); VEC(string, G, H); vv(int, IDX, H, W); int a = 0, b = 0; FOR(x, H) FOR(y, W) { if ((x + y) % 2 == 0) IDX[x][y] = a++; if ((x + y) % 2 == 1) IDX[x][y] = b++; } auto isin = [&](int x, int y) -> bool { return (0 <= x && x < H && 0 <= y && y < W); }; int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}; int dy[] = {0, 1, 0, -1, 1, -1, 1, -1}; vc adj(a, My_Bitset(b)); FOR(x, H) FOR(y, W) { if ((x + y) & 1) continue; FOR(d, 4) { int nx = x + dx[d], ny = y + dy[d]; if (!isin(nx, ny)) continue; if (G[x][y] == G[nx][ny]) continue; if (G[x][y] == '.') continue; if (G[nx][ny] == '.') continue; adj[IDX[x][y]][IDX[nx][ny]] = 1; } } BipartiteMatching_Dense BM(adj, a, b); auto match = BM.matching(); int n = len(match); int x = 0, y = 0; FOR(i, H) FOR(j, W) x += (G[i][j] == 'w'); FOR(i, H) FOR(j, W) y += (G[i][j] == 'b'); x -= n, y -= n; int ANS = 0; ANS += 100 * n; int m = min(x, y); ANS += 10 * m; ANS += x + y - 2 * m; print(ANS); } signed main() { solve(); return 0; }