#467792 (Python3) No.421 しろくろチョコレート

• 問題: No.421 しろくろチョコレート
• ユーザー: mkawa2
• 提出日時: 2020-04-21 18:44:50
• 言語: Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1)
• 結果: AC
• 実行時間: 241 ms / 2,000 ms
• コード長: 3,962 bytes
• コンパイル時間: 93 ms
• コンパイル使用メモリ: 12,928 KB
• 実行使用メモリ: 13,056 KB
• 最終ジャッジ日時: 2024-09-23 07:25:20
• 合計ジャッジ時間: 4,811 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

ファイルパターン	結果
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
from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys
sys.setrecursionlimit(10 ** 6)
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]
class Dinic():
    def __init__(self, n, s, t):
        self.n, self.s, self.t = n, s, t
        self.to = defaultdict(list)
        self.level = [-1]
        self.max_flow = -1
    def add_edge(self, u, v, cap):
        u_index_in_to_v = len(self.to[v])
        v_index_in_to_u = len(self.to[u])
        self.to[u].append([v, cap, u_index_in_to_v])
        self.to[v].append([u, 0, v_index_in_to_u])
    # 無向辺の追加
    def add_undir_edge(self, u, v, cap):
        u_index_in_to_v = len(self.to[v])
        v_index_in_to_u = len(self.to[u])
        self.to[u].append([v, cap, u_index_in_to_v])
        self.to[v].append([u, cap, v_index_in_to_u])
    def set_level(self):
        s = self.s
        level = [-1] * self.n
        level[s] = 0
        q = deque()
        q.append([s, 0])
        while q:
            u, u_level = q.popleft()
            for v, cap, _ in self.to[u]:
                if cap == 0: continue
                if level[v] != -1: continue
                level[v] = u_level + 1
                if v == self.t:
                    self.level = level
                    return True
                q.append([v, u_level + 1])
        return False
    def dfs(self, u=-1, flow_to_me=10 ** 16):
        if u == -1: u = self.s
        if u == self.t: return flow_to_me
        flow_from_me = 0
        u_level = self.level[u]
        for utov_i, (v, cap, vtou_i) in enumerate(self.to[u]):
            if self.level[v] != u_level + 1: continue
            if cap == 0: continue
            flow_to_v = self.dfs(v, min(cap, flow_to_me - flow_from_me))
            if not flow_to_v: continue
            flow_from_me += flow_to_v
            self.to[u][utov_i][1] -= flow_to_v
            self.to[v][vtou_i][1] += flow_to_v
        return flow_from_me
    def calculation(self):
        res = 0
        while self.set_level():
            res += self.dfs()
        return res
    # これが出力用
    def get_max_flow(self):
        if self.max_flow == -1:
            self.max_flow = self.calculation()
        return self.max_flow
def main():
    h,w=MI()
    ss=[SI() for _ in range(h)]
    aa=[[0]*w for _ in range(h)]
    # 始点を頂点0、終点を頂点1とするので、W,Bに2から頂点番号を振っていく
    cnt=2
    for i,j in product(range(h),range(w)):
        if ss[i][j]==".":continue
        aa[i][j]=cnt
        cnt+=1
    # 最大流のライブラリ
    mf=Dinic(cnt,0,1)
    # それぞれのマスから右と下に辺を張るとともにw,bの数を数える
    wc=bc=0
    for i,j in product(range(h),range(w)):
        a=aa[i][j]
        if a==0:continue
        # 黒のとき（2部グラフの右側）
        if (i+j)%2:
            bc+=1
            mf.add_edge(a,1,1)
            if j+1<w and aa[i][j+1]:mf.add_edge(aa[i][j+1],a,1)
            if i+1<h and aa[i+1][j]:mf.add_edge(aa[i+1][j],a,1)
        # 白のとき（2部グラフの左側）
        else:
            wc+=1
            mf.add_edge(0,a,1)
            if j+1<w and aa[i][j+1]:mf.add_edge(a,aa[i][j+1],1)
            if i+1<h and aa[i+1][j]:mf.add_edge(a,aa[i+1][j],1)
    # ペアの組数がp
    p=mf.get_max_flow()
    wc,bc=wc-p,bc-p
    mn=min(wc,bc)
    ans=p*100+mn*10+wc+bc-2*mn
    print(ans)
main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX