結果

問題 No.421 しろくろチョコレート
ユーザー vwxyzvwxyz
提出日時 2021-07-22 21:05:06
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 241 ms / 2,000 ms
コード長 5,708 bytes
コンパイル時間 271 ms
コンパイル使用メモリ 82,428 KB
実行使用メモリ 94,072 KB
最終ジャッジ日時 2024-09-23 07:33:13
合計ジャッジ時間 14,172 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 155 ms
89,416 KB
testcase_01 AC 221 ms
92,448 KB
testcase_02 AC 173 ms
89,944 KB
testcase_03 AC 157 ms
89,376 KB
testcase_04 AC 165 ms
89,892 KB
testcase_05 AC 176 ms
89,804 KB
testcase_06 AC 161 ms
89,372 KB
testcase_07 AC 201 ms
92,064 KB
testcase_08 AC 169 ms
89,664 KB
testcase_09 AC 160 ms
89,600 KB
testcase_10 AC 162 ms
89,292 KB
testcase_11 AC 203 ms
92,324 KB
testcase_12 AC 154 ms
89,460 KB
testcase_13 AC 155 ms
89,448 KB
testcase_14 AC 154 ms
89,296 KB
testcase_15 AC 151 ms
89,464 KB
testcase_16 AC 232 ms
93,108 KB
testcase_17 AC 241 ms
93,356 KB
testcase_18 AC 227 ms
93,212 KB
testcase_19 AC 152 ms
89,308 KB
testcase_20 AC 223 ms
93,048 KB
testcase_21 AC 224 ms
92,580 KB
testcase_22 AC 203 ms
92,168 KB
testcase_23 AC 149 ms
89,204 KB
testcase_24 AC 156 ms
89,332 KB
testcase_25 AC 150 ms
89,288 KB
testcase_26 AC 157 ms
89,264 KB
testcase_27 AC 154 ms
89,160 KB
testcase_28 AC 210 ms
92,372 KB
testcase_29 AC 217 ms
92,760 KB
testcase_30 AC 215 ms
92,496 KB
testcase_31 AC 225 ms
93,976 KB
testcase_32 AC 219 ms
92,628 KB
testcase_33 AC 218 ms
92,508 KB
testcase_34 AC 160 ms
89,596 KB
testcase_35 AC 160 ms
89,600 KB
testcase_36 AC 203 ms
92,340 KB
testcase_37 AC 229 ms
93,552 KB
testcase_38 AC 233 ms
93,324 KB
testcase_39 AC 182 ms
89,924 KB
testcase_40 AC 217 ms
92,436 KB
testcase_41 AC 167 ms
90,056 KB
testcase_42 AC 168 ms
89,676 KB
testcase_43 AC 189 ms
90,560 KB
testcase_44 AC 225 ms
93,180 KB
testcase_45 AC 166 ms
89,684 KB
testcase_46 AC 169 ms
89,812 KB
testcase_47 AC 213 ms
92,592 KB
testcase_48 AC 230 ms
93,784 KB
testcase_49 AC 183 ms
90,292 KB
testcase_50 AC 171 ms
90,012 KB
testcase_51 AC 222 ms
92,900 KB
testcase_52 AC 195 ms
92,356 KB
testcase_53 AC 166 ms
89,952 KB
testcase_54 AC 180 ms
90,632 KB
testcase_55 AC 163 ms
89,772 KB
testcase_56 AC 167 ms
89,560 KB
testcase_57 AC 176 ms
90,008 KB
testcase_58 AC 221 ms
92,456 KB
testcase_59 AC 176 ms
90,024 KB
testcase_60 AC 240 ms
93,408 KB
testcase_61 AC 235 ms
94,072 KB
testcase_62 AC 153 ms
89,296 KB
testcase_63 AC 153 ms
89,364 KB
testcase_64 AC 154 ms
89,584 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
from typing import NamedTuple, Optional, List, cast

class MFGraph:
    class Edge(NamedTuple):
        src: int
        dst: int
        cap: int
        flow: int
 
    class _Edge:
        def __init__(self, dst: int, cap: int) -> None:
            self.dst = dst
            self.cap = cap
            self.rev: Optional[MFGraph._Edge] = None
 
    def __init__(self, n: int) -> None:
        self._n = n
        self._g: List[List[MFGraph._Edge]] = [[] for _ in range(n)]
        self._edges: List[MFGraph._Edge] = []
 
    def add_edge(self, src: int, dst: int, cap: int) -> int:
        assert 0 <= src < self._n
        assert 0 <= dst < self._n
        assert 0 <= cap
        m = len(self._edges)
        e = MFGraph._Edge(dst, cap)
        re = MFGraph._Edge(src, 0)
        e.rev = re
        re.rev = e
        self._g[src].append(e)
        self._g[dst].append(re)
        self._edges.append(e)
        return m
 
    def get_edge(self, i: int) -> Edge:
        assert 0 <= i < len(self._edges)
        e = self._edges[i]
        re = cast(MFGraph._Edge, e.rev)
        return MFGraph.Edge(
            re.dst,
            e.dst,
            e.cap + re.cap,
            re.cap
        )
 
    def edges(self) -> List[Edge]:
        return [self.get_edge(i) for i in range(len(self._edges))]
 
    def change_edge(self, i: int, new_cap: int, new_flow: int) -> None:
        assert 0 <= i < len(self._edges)
        assert 0 <= new_flow <= new_cap
        e = self._edges[i]
        e.cap = new_cap - new_flow
        assert e.rev is not None
        e.rev.cap = new_flow
 
    def flow(self, s: int, t: int, flow_limit: Optional[int] = None) -> int:
        assert 0 <= s < self._n
        assert 0 <= t < self._n
        assert s != t
        if flow_limit is None:
            flow_limit = cast(int, sum(e.cap for e in self._g[s]))
 
        current_edge = [0] * self._n
        level = [0] * self._n
 
        def fill(arr: List[int], value: int) -> None:
            for i in range(len(arr)):
                arr[i] = value
 
        def bfs() -> bool:
            fill(level, self._n)
            queue = []
            q_front = 0
            queue.append(s)
            level[s] = 0
            while q_front < len(queue):
                v = queue[q_front]
                q_front += 1
                next_level = level[v] + 1
                for e in self._g[v]:
                    if e.cap == 0 or level[e.dst] <= next_level:
                        continue
                    level[e.dst] = next_level
                    if e.dst == t:
                        return True
                    queue.append(e.dst)
            return False
 
        def dfs(lim: int) -> int:
            stack = []
            edge_stack: List[MFGraph._Edge] = []
            stack.append(t)
            while stack:
                v = stack[-1]
                if v == s:
                    flow = min(lim, min(e.cap for e in edge_stack))
                    for e in edge_stack:
                        e.cap -= flow
                        assert e.rev is not None
                        e.rev.cap += flow
                    return flow
                next_level = level[v] - 1
                while current_edge[v] < len(self._g[v]):
                    e = self._g[v][current_edge[v]]
                    re = cast(MFGraph._Edge, e.rev)
                    if level[e.dst] != next_level or re.cap == 0:
                        current_edge[v] += 1
                        continue
                    stack.append(e.dst)
                    edge_stack.append(re)
                    break
                else:
                    stack.pop()
                    if edge_stack:
                        edge_stack.pop()
                    level[v] = self._n
            return 0
 
        flow = 0
        while flow < flow_limit:
            if not bfs():
                break
            fill(current_edge, 0)
            while flow < flow_limit:
                f = dfs(flow_limit - flow)
                flow += f
                if f == 0:
                    break
        return flow
 
    def min_cut(self, s: int) -> List[bool]:
        visited = [False] * self._n
        stack = [s]
        visited[s] = True
        while stack:
            v = stack.pop()
            for e in self._g[v]:
                if e.cap > 0 and not visited[e.dst]:
                    visited[e.dst] = True
                    stack.append(e.dst)
        return visited

N,M=map(int,readline().split())
S=[readline().rstrip() for i in range(N)]
MFG=MFGraph(N*M+2)
s=0
t=N*M+1
cntw=0
cntb=0
for i in range(N):
    for j in range(M):
        if S[i][j]=='w':
            MFG.add_edge(0,i*M+j+1,1)
            cntw+=1
            for di,dj in ((0,1),(1,0),(0,-1),(-1,0)):
                if 0<=i+di<=N-1 and 0<=j+dj<=M-1 and S[i+di][j+dj]=='b':
                    MFG.add_edge(i*M+j+1,(i+di)*M+j+dj+1,1)
        if S[i][j]=='b':
            MFG.add_edge(i*M+j+1,t,1)
            cntb+=1
ans=cntb+cntw+min(cntw,cntb)*8+MFG.flow(s,t)*90
print(ans)
0