結果
問題 | No.421 しろくろチョコレート |
ユーザー |
![]() |
提出日時 | 2021-11-25 22:40:44 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 7,842 bytes |
コンパイル時間 | 3,820 ms |
コンパイル使用メモリ | 259,932 KB |
最終ジャッジ日時 | 2025-01-26 01:14:21 |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 65 |
ソースコード
#line 1 "Contests/yukicoder_/277/main.cpp"#define aclmodint#define aclsegtree#include <atcoder/all>using namespace atcoder;#line 1 "library/me/template.cpp"#include <bits/stdc++.h>using namespace std;#define REP(i, n) for(int i = 0; i < (int)(n); i++)#define FOR(i, a, b) for(ll i = a; i < (ll)(b); i++)#define ALL(a) (a).begin(),(a).end()#define END(a) { print(a); return; }#define DBG(a) { cerr << #a << ": "; dbg(a); }using VI = vector<int>;using VVI = vector<VI>;using VVVI = vector<VVI>;using ll = long long;using VL = vector<ll>;using VVL = vector<VL>;using VVVL = vector<VVL>;using VD = vector<double>;using VVD = vector<VD>;using VVVD = vector<VVD>;using VS = vector<string>;using VVS = vector<VS>;using VVVS = vector<VVS>;using VC = vector<char>;using VVC = vector<VC>;using VVVC = vector<VVC>;using P = pair<int, int>;using VP = vector<P>;using VVP = vector<VP>;using VVVP = vector<VVP>;using LP = pair<ll, ll>;using VLP = vector<LP>;using VVLP = vector<VLP>;using VVVLP = vector<VVLP>;constexpr int INF = 1001001001;constexpr ll LINF = 1001001001001001001ll;constexpr int DX[] = {1, 0, -1, 0};constexpr int DY[] = {0, 1, 0, -1};#ifdef aclmodintusing MI7 = modint1000000007;using V7 = vector<MI7>;using VV7 = vector<V7>;using VVV7 = vector<VV7>;using MI3 = modint998244353;using V3 = vector<MI3>;using VV3 = vector<V3>;using VVV3 = vector<VV3>;ostream &operator<<(ostream &os, const modint &x) {os << x.val();return os;}ostream &operator<<(ostream &os, const MI3 &x) {os << x.val();return os;}ostream &operator<<(ostream &os, const MI7 &x) {os << x.val();return os;}istream &operator>>(istream &is, modint &x) {int y; is >> y;x = y;return is;}istream &operator>>(istream &is, MI3 &x) {int y; is >> y;x = y;return is;}istream &operator>>(istream &is, MI7 &x) {int y; is >> y;x = y;return is;}#endifvoid print() { cout << '\n'; }template<typename T>void print(const T &t) { cout << t << '\n'; }template<typename Head, typename... Tail>void print(const Head &head, const Tail &... tail) {cout << head << ' ';print(tail...);}void dbg() { cout << '\n'; }template<typename T>void dbg(const T &t) { cerr << t << '\n'; }template<typename Head, typename... Tail>void dbg(const Head &head, const Tail &... tail) {cerr << head << ' ';dbg(tail...);}template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T >ostream &operator<<(ostream &os, const vector< T > &v) {for(int i = 0; i < (int) v.size(); i++) {os << v[i] << (i + 1 != (int) v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in : v) is >> in;return is;}template< typename T1, typename T2 >inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }template< typename T1, typename T2 >inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }template <typename T>pair<VI, vector<T>> compress(const vector<T> &a) {int n = a.size();vector<T> x;REP(i, n) x.push_back(a[i]);sort(ALL(x)); x.erase(unique(ALL(x)), x.end());VI res(n);REP(i, n) res[i] = lower_bound(ALL(x), a[i]) - x.begin();return make_pair(res, x);}#ifdef aclsegtreetemplate<typename S>struct value_size { S value; int size; };template<typename S>S min_op(S l, S r) { return min(l, r); };template<typename S>S max_op(S l, S r) { return max(l, r); };template<typename S>S sum_op(S l, S r) { return l + r; };template<typename S>value_size<S> sum_op_size(value_size<S> l, value_size<S> r) {return {l.value + r.value, l.size + r.size};};template<typename S>value_size<S> min_op_size(value_size<S> l, value_size<S> r) {return {min(l.value, r.value), l.size + r.size};};template<typename S>value_size<S> max_op_size(value_size<S> l, value_size<S> r) {return {max(l.value, r.value), l.size + r.size};};template<typename S>S min_e() { return numeric_limits<S>::max(); };template<typename S>S max_e() { return numeric_limits<S>::min(); };template<typename S>S sum_e() { return 0; }template<typename S>value_size<S> sum_e_size() { return {0, 0}; }template<typename S>value_size<S> min_e_size() { return {numeric_limits<S>::max(), 0}; }template<typename S>value_size<S> max_e_size() { return {numeric_limits<S>::min(), 0}; }template<typename S, typename F>S chmin_mapping(F f, S x) { return min(x, f); }template<typename S, typename F>S chmax_mapping(F f, S x) { return max(x, f); }template<typename S, typename F>S add_mapping(F f, S x) { return x + f; }template<typename S, typename F>value_size<S> add_mapping_size(F f, value_size<S> x) {return {x.value + x.size * f, x.size};}template<typename F>F chmin_composition(F f, F g) { return min(f, g); }template<typename F>F chmax_composition(F f, F g) { return max(f, g); }template<typename F>F add_composition(F f, F g) { return f + g; }template<typename F>F chmin_id() { return numeric_limits<F>::max(); }template<typename F>F chmax_id() { return numeric_limits<F>::min(); }template<typename F>F add_id() { return 0; }template<typename S>using RSumQ = segtree<S, sum_op<S>, sum_e<S>>;template<typename S>using RMaxQ = segtree<S, max_op<S>, max_e<S>>;template<typename S>using RMinQ = segtree<S, min_op<S>, min_e<S>>;template<typename S, typename F>using RAddSumQ = lazy_segtree<value_size<S>, sum_op_size<S>, sum_e_size<S>,F, add_mapping_size<S, F>, add_composition<F>, add_id<F>>;template<typename S, typename F>using RAddMinQ = lazy_segtree<S, min_op<S>, min_e<S>,F, add_mapping<S, F>, add_composition<F>, add_id<F>>;template<typename S, typename F>using RAddMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,F, add_mapping<S, F>, add_composition<F>, add_id<F>>;template<typename S, typename F>using RMinMinQ = lazy_segtree<S, min_op<S>, min_e<S>,F, chmin_mapping<S, F>, chmin_composition<F>, chmin_id<F>>;template<typename S, typename F>using RMaxMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,F, chmax_mapping<S, F>, chmax_composition<F>, chmax_id<F>>;#endif#line 7 "Contests/yukicoder_/277/main.cpp"void solve(){int n, m; cin >> n >> m;VS s(n); cin >> s;int w = 0, b = 0;REP(i, n) REP(j, m) {if(s[i][j] == 'w') w++;if(s[i][j] == 'b') b++;}mf_graph<int> mfg(n * m + 2);REP(i, n) REP(j, m - 1) {if(s[i][j] != '.' && s[i][j+1] != '.') {if((i+j)%2 == 0) mfg.add_edge(i*m+j, i*m+j+1, 1);else mfg.add_edge(i*m+j+1, i*m+j, 1);}}REP(i, n - 1) REP(j, m) {if(s[i][j] != '.' && s[i+1][j] != '.') {if((i+j)%2 == 0) mfg.add_edge(i*m+j, (i+1)*m+j, 1);else mfg.add_edge((i+1)*m+j, i*m+j, 1);}}REP(i, n) REP(j, m) {if((i+j)%2 == 0) mfg.add_edge(m*n, i*m+j, 1);else mfg.add_edge(i*m+j, n*m+1, 1);}int ans = mfg.flow(n*m, n*m+1);w -= ans; b -= ans;print(ans * 100 + min(w, b)*10 + (max(w,b)-min(w,b)));}// generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator)int main() {// Fasterize input/output scriptios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(100);// scanf/printf user should delete this fasterize input/output scriptint t = 1;//cin >> t; // comment out if solving multi testcasefor(int testCase = 1;testCase <= t;++testCase){solve();}return 0;}