#117640 (C++14) No.421 しろくろチョコレート

• 問題: No.421 しろくろチョコレート
• ユーザー: ctyl_0
• 提出日時: 2016-09-16 20:42:38
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 14 ms / 2,000 ms
• コード長: 3,248 bytes
• コンパイル時間: 1,302 ms
• コンパイル使用メモリ: 113,120 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-09-23 07:08:25
• 合計ジャッジ時間: 3,138 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
other	AC * 65

ソースコード

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
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p) {
    if(p) cout << fixed << setprecision(p)  << a << "\n";
    else cout << a << "\n";
}
// end of template
// goal, capacity, index of reverse edge
struct edge {
    int to, cap, rev;
};
// O(EV^2)
class Dinic{
public:
    int V;
    vector<vector<edge>> G;
    vector<int> L;
    vector<int> I;
    
    Dinic(int v){
        G.resize(v), L.resize(v), I.resize(v);
        V = v;
    }
    
    // add edge
    void add(int from, int to, int cap){
        G[from].push_back((edge){to, cap, (int)G[to].size()});
        G[to].push_back((edge){from, 0, (int)G[from].size() - 1});
    }
    
    // label dist from s
    void bfs(int s){
        L.assign(V, -1);
        queue<int> q;
        L[s] = 0;
        q.push(s);
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            rep(i, G[v].size()){
                edge &e = G[v][i];
                if (e.cap > 0 && L[e.to] < 0) {
                    L[e.to] = L[v] + 1;
                    q.push(e.to);
                }
            }
        }
    }
    
    // search positive path
    int dfs(int v, int t, int f){
        if (v == t) return f;
        for (int &i = I[v]; i < G[v].size(); i++) {
            edge &e = G[v][i];
            if (e.cap > 0 && L[v] < L[e.to]) {
                int d = dfs(e.to, t, min(f, e.cap));
                if (d) {
                    e.cap -= d;
                    G[e.to][e.rev].cap += d;
                    return d;
                }
            }
        }
        return 0;
    }
    
    // calc max flow
    int max_flow(int s, int t){
        int flow = 0;
        for (;;) {
            bfs(s);
            if (L[t] < 0) return flow;
            I.assign(V, 0);
            int f;
            while ((f = dfs(s, t, inf)) > 0) {
                flow += f;
            }
        }
    }
};
int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    
    int H, W;
    cin >> H >> W;
    vector<string> A(H);
    rep(i, H) cin >> A[i];
    Dinic mf(H * W + 2);
    int white = 0, bitter = 0;
    rep(i, H) rep(j, W){
        if(A[i][j] == 'w') {
            white++;
            mf.add(0, i * W + j + 1, 1);
        }
        if(A[i][j] == 'b') {
            bitter++;
            mf.add(i * W + j + 1, H * W + 1, 1);
        }
    }
    int ret = 0;
    rep(i, H) rep(j, W) rep(k, H) rep(l, W){
        if(A[i][j] == 'w' && A[k][l] == 'b'){
            if(abs(i - k) + abs(j - l) == 1){
                mf.add(i * W + j + 1, k * W + l + 1, 1);
            }
        }
    }
    ret += mf.max_flow(0, H * W + 1);
    white -= ret, bitter -= ret;
    output(ret * 100 + min(white, bitter) * 10 + abs(white - bitter), 0);
    
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX