結果

問題 No.421 しろくろチョコレート
ユーザー はむ吉🐹はむ吉🐹
提出日時 2016-09-10 12:55:56
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 402 ms / 2,000 ms
コード長 2,818 bytes
コンパイル時間 138 ms
コンパイル使用メモリ 12,072 KB
実行使用メモリ 15,644 KB
最終ジャッジ日時 2023-10-24 14:48:33
合計ジャッジ時間 8,299 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
10,464 KB
testcase_01 AC 143 ms
12,036 KB
testcase_02 AC 55 ms
11,148 KB
testcase_03 AC 35 ms
10,588 KB
testcase_04 AC 44 ms
10,932 KB
testcase_05 AC 46 ms
10,976 KB
testcase_06 AC 35 ms
10,624 KB
testcase_07 AC 74 ms
11,616 KB
testcase_08 AC 50 ms
11,160 KB
testcase_09 AC 38 ms
10,724 KB
testcase_10 AC 39 ms
10,728 KB
testcase_11 AC 78 ms
11,644 KB
testcase_12 AC 32 ms
10,432 KB
testcase_13 AC 32 ms
10,432 KB
testcase_14 AC 31 ms
10,432 KB
testcase_15 AC 32 ms
10,432 KB
testcase_16 AC 233 ms
12,996 KB
testcase_17 AC 300 ms
13,028 KB
testcase_18 AC 302 ms
13,084 KB
testcase_19 AC 32 ms
10,432 KB
testcase_20 AC 162 ms
12,544 KB
testcase_21 AC 192 ms
12,816 KB
testcase_22 AC 77 ms
11,684 KB
testcase_23 AC 32 ms
10,432 KB
testcase_24 AC 31 ms
10,432 KB
testcase_25 AC 32 ms
10,432 KB
testcase_26 AC 32 ms
10,432 KB
testcase_27 AC 31 ms
10,432 KB
testcase_28 AC 103 ms
12,088 KB
testcase_29 AC 142 ms
12,576 KB
testcase_30 AC 123 ms
12,100 KB
testcase_31 AC 402 ms
15,644 KB
testcase_32 AC 120 ms
12,308 KB
testcase_33 AC 133 ms
12,568 KB
testcase_34 AC 38 ms
11,096 KB
testcase_35 AC 39 ms
11,104 KB
testcase_36 AC 90 ms
11,676 KB
testcase_37 AC 219 ms
13,076 KB
testcase_38 AC 299 ms
13,408 KB
testcase_39 AC 73 ms
11,360 KB
testcase_40 AC 115 ms
12,584 KB
testcase_41 AC 46 ms
11,072 KB
testcase_42 AC 43 ms
10,912 KB
testcase_43 AC 85 ms
11,676 KB
testcase_44 AC 167 ms
13,096 KB
testcase_45 AC 46 ms
10,944 KB
testcase_46 AC 51 ms
10,992 KB
testcase_47 AC 144 ms
11,880 KB
testcase_48 AC 264 ms
14,792 KB
testcase_49 AC 71 ms
11,252 KB
testcase_50 AC 51 ms
10,996 KB
testcase_51 AC 174 ms
13,020 KB
testcase_52 AC 78 ms
11,608 KB
testcase_53 AC 39 ms
10,856 KB
testcase_54 AC 57 ms
11,196 KB
testcase_55 AC 39 ms
10,732 KB
testcase_56 AC 37 ms
10,724 KB
testcase_57 AC 48 ms
10,972 KB
testcase_58 AC 126 ms
11,976 KB
testcase_59 AC 60 ms
11,112 KB
testcase_60 AC 315 ms
14,560 KB
testcase_61 AC 289 ms
14,724 KB
testcase_62 AC 32 ms
10,448 KB
testcase_63 AC 32 ms
10,448 KB
testcase_64 AC 32 ms
11,008 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#!/usr/bin/env python3

import array
import collections
import itertools
import sys


DELTAS = [(1, 0), (-1, 0), (0, 1), (0, -1)]
INF = 10 ** 8
REC_LIMIT = 10000
FlowEdge = collections.namedtuple("FlowEdge", "source sink capacity")


class FlowNetwork(object):

    def __init__(self, num_vertices):
        self.adj_edges = [set() for _ in range(num_vertices)]
        self.flow = None
        self.rev_edge = dict()
        self.used = None

    def get_edges_from(self, vertex):
        return self.adj_edges[vertex]

    def add_edge(self, source, sink, capacity=1):
        assert source != sink
        forward_edge = FlowEdge(source, sink, capacity)
        backward_edge = FlowEdge(sink, source, 0)
        self.rev_edge[forward_edge] = backward_edge
        self.rev_edge[backward_edge] = forward_edge
        self.adj_edges[source].add(forward_edge)
        self.adj_edges[sink].add(backward_edge)

    def dfs(self, source, sink, flow):
        if source == sink:
            return flow
        self.used[source] = True
        for edge in self.get_edges_from(source):
            rest = edge.capacity - self.flow[edge]
            if self.used[edge.sink] or rest <= 0:
                continue
            d = self.dfs(edge.sink, sink, min(flow, rest))
            if d > 0:
                self.flow[edge] += d
                self.flow[self.rev_edge[edge]] -= d
                return d
        return 0

    def ford_fulkerson(self, source, sink):
        self.flow = collections.defaultdict(int)
        max_flow = 0
        while True:
            self.used = collections.defaultdict(bool)
            df = self.dfs(source, sink, INF)
            if df == 0:
                return max_flow
            else:
                max_flow += df


def main():
    sys.setrecursionlimit(REC_LIMIT)
    n, m = map(int, input().split())
    board = [input() for _ in range(n)]
    num_vs = n * m + 2
    source = n * m
    sink = n * m + 1
    fn = FlowNetwork(num_vs)
    white = 0
    black = 0
    for r0, c0 in itertools.product(range(n), range(m)):
        if board[r0][c0] == "w":
            white += 1
            w = r0 * m + c0
            fn.add_edge(source, w)
            for dr, dc in DELTAS:
                r, c = r0 + dr, c0 + dc
                if r < 0 or r >= n or c < 0 or c >= m:
                    continue
                elif board[r][c] == "b":
                    b = r * m + c
                    fn.add_edge(w, b)
                    fn.add_edge(b, sink)
        elif board[r0][c0] == "b":
            black += 1
    mf = fn.ford_fulkerson(source, sink)
    ans = mf * 100
    white -= mf
    black -= mf
    meth2 = min(white, black)
    ans += meth2 * 10
    white -= meth2
    black -= meth2
    ans += max(white, black)
    print(ans)


if __name__ == '__main__':
    main()
0