#210020 (C++11（廃止可能性あり）) No.421 しろくろチョコレート

• 問題: No.421 しろくろチョコレート
• ユーザー: nksk38
• 提出日時: 2017-10-15 14:31:52
• 言語: C++11（廃止可能性あり） (gcc 13.3.0)
• 結果: WA
• 実行時間: -
• コード長: 2,253 bytes
• コンパイル時間: 2,122 ms
• コンパイル使用メモリ: 87,968 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-11-17 17:43:14
• 合計ジャッジ時間: 2,453 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
other	AC * 18 WA * 47

ソースコード

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
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iterator>
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,n) for(int i=a; i<n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;
typedef pair<string, string> pss;
const int INF = 1e9;
const int MAX_V = 3000;
struct Flow {
    struct edge {
        int to, cap, rev;
    };
    vector<edge> G[MAX_V];
    bool used[MAX_V];
    void add_edge(int from, int to, int cap) {
        G[from].push_back( { to, cap, (int)G[to].size() });//from -> to
        G[to].push_back({ from, 0, (int)G[from].size() - 1 });//to -> from
    }
    int dfs(int v, int t, int f) {
        if (v == t)return f;
        used[v] = true;
        for (int i = 0; i < G[v].size(); i++) {
            edge &e = G[v][i];
            if (!used[e.to] && e.cap > 0) {
                int d = dfs(e.to, t, min(f, e.cap));
                if (d > 0) {
                    e.cap = -d;
                    G[e.to][e.rev].cap += d;
                    return d;
                }
            }
        }
        return 0;
    }
    int max_flow(int s, int t) {
        int flow = 0;
        while (1) {
            memset(used, 0, sizeof(used));
            int f = dfs(s, t, INF);
            if (f == 0)return flow;
            flow += f;
        }
    }
};
string board[55];
int dy[] = { 1,0,0,-1 };
int dx[] = { 0,1,-1,0 };
int n, m;
int main()
{
    cin >> n >> m;
    rep(i, n)cin >> board[i];
    int s = n * m;
    int t = n * m + 1;
    int numw = 0, numb = 0;
    Flow mf;
    //s -> w  b -> t
    rep(i, n)rep(j, m) {
        if (board[i][j] == 'w') {
            mf.add_edge(s, m*i + j, 1);
            numw++;
        }
        else if (board[i][j] == 'b') {
            mf.add_edge(m*i+j,t,1);
            numb++;
        }
    }
    // x -> y
    rep(i, n)rep(j, m) {
        if (board[i][j] == 'w') {
            rep(k, 4) {
                int ny = i + dy[k], nx = j + dx[k];
                if (!(0 <= ny && ny < n && 0 <= nx && nx < m))continue;
                if (board[ny][nx] == 'b')
                    mf.add_edge(m*i + j, m*ny + nx, 1);
            }
        }
    }
    int max_f = mf.max_flow(s, t);
    int nw = numw - max_f, nb = numb - max_f;
    int two = min(nw, nb);
    int one = nw + nb - (two) * 2;
    cout << 100 * max_f + 10 * 10*two + one << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX