結果

問題 No.421 しろくろチョコレート
ユーザー mai
提出日時 2017-10-10 00:10:53
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 25 ms / 2,000 ms
コード長 9,575 bytes
コンパイル時間 15,103 ms
コンパイル使用メモリ 291,728 KB
最終ジャッジ日時 2025-01-05 03:12:29
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 65
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

// ライブラリ整備用提出
#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<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
#define EPS 1e-12
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; 
    }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> 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<ll>(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<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(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<typename IT> 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<a.left) | (cap<a.cap) | (from<a.from) | (to<a.to); }
        bool operator==(const Arrow& a) const { return (from == a.from) && (to == a.to) && (left == a.left) && (cap == a.cap); }
    };
    vector<vector<int>> vertex_to;
    vector<vector<int>> vertex_from;
    vector<Arrow> 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<Flow::cap_t>& result, int i_source, int i_sink) {
    assert(i_source != i_sink);
    result.resize(flow.n);
    vector<int> dist(flow.n);
    queue<int> q;
    vector<int> flag(flow.n);
    static function<Flow::cap_t(int, int, Flow::cap_t)> _dfs = [&](int u, int i_sink, Flow::cap_t 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]) {
            auto& edge = flow.arrow[e];
            if (edge.left > 0 && dist[u]>dist[edge.to]) {
                Flow::cap_t w;
                if (mini < 0)
                    w = edge.left;
                else
                    w = min(edge.left, mini);
                w = _dfs(edge.to, i_sink, w);
                if (w == -1) continue;
                edge.left -= w;
                result[edge.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]) {
            auto& edge = flow.arrow[e];
            if (edge.cap>edge.left && dist[u]>dist[edge.from]) {
                Flow::cap_t w;
                if (mini < 0)
                    w = edge.cap - edge.left;
                else
                    w = min(edge.cap - edge.left, mini);
                w = _dfs(edge.from, i_sink, w);
                if (w == -1) continue;
                edge.left += w;
                result[edge.to] -= w;
                sumw += w;
                mini -= w;
                term = false;
                flag[u] = false;
                if (mini == 0) return term ? -1 : sumw;
            }
        }
        return term ? -1 : sumw;
    };
    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(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<n; i++)
            flow.connect(ss, i, 1);
        for (int i = 0; i<m; i++)
            flow.connect(n + i, ss + 1, 1);
    }
    void connect(int l, int r) {
        flow.connect(l, r + n, 1);
    }
    int solve_dinic(set<Flow::Arrow>& result) {
        int count = 0;
        vector<int> 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<height; y++) {
        cin >> cho[y];
    }
    int white, black;
    white = black = 0;
    for (y = 0; y<height; y++) {
        for (x = 0; x<width; x++) {
            if (cho[y][x] == '.') continue;
            if (cho[y][x] == 'w')
                white++;
            else
                black++;
            if ((y^x) & 1) continue;
            if (0 < x && cho[y][x - 1] != '.')
                bm.connect(x + y*width, x - 1 + y*width);
            if (0 < y && cho[y - 1][x] != '.')
                bm.connect(x + y*width, x + (y - 1)*width);
            if (width - 1 > 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<Flow::Arrow> 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;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0