#1057098 (PyPy3) No.421 しろくろチョコレート

• 問題: No.421 しろくろチョコレート
• ユーザー: ntuda
• 提出日時: 2025-03-21 21:04:57
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 192 ms / 2,000 ms
• コード長: 2,560 bytes
• コンパイル時間: 592 ms
• コンパイル使用メモリ: 81,792 KB
• 実行使用メモリ: 80,632 KB
• 最終ジャッジ日時: 2025-03-21 21:05:06
• 合計ジャッジ時間: 8,006 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
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
# Dinic's algorithm
from collections import deque
class Dinic:
    def __init__(self, N):
        self.N = N
        self.G = [[] for i in range(N)]
    def add_edge(self, fr, to, cap):
        forward = [to, cap, None]
        forward[2] = backward = [fr, 0, forward]
        self.G[fr].append(forward)
        self.G[to].append(backward)
    def add_multi_edge(self, v1, v2, cap1, cap2):
        edge1 = [v2, cap1, None]
        edge1[2] = edge2 = [v1, cap2, edge1]
        self.G[v1].append(edge1)
        self.G[v2].append(edge2)
    def bfs(self, s, t):
        self.level = level = [None] * self.N
        deq = deque([s])
        level[s] = 0
        G = self.G
        while deq:
            v = deq.popleft()
            lv = level[v] + 1
            for w, cap, _ in G[v]:
                if cap and level[w] is None:
                    level[w] = lv
                    deq.append(w)
        return level[t] is not None
    def dfs(self, v, t, f):
        if v == t:
            return f
        level = self.level
        for e in self.it[v]:
            w, cap, rev = e
            if cap and level[v] < level[w]:
                d = self.dfs(w, t, min(f, cap))
                if d:
                    e[1] -= d
                    rev[1] += d
                    return d
        return 0
    def flow(self, s, t):
        flow = 0
        INF = 10 ** 9 + 7
        G = self.G
        while self.bfs(s, t):
            *self.it, = map(iter, self.G)
            f = INF
            while f:
                f = self.dfs(s, t, INF)
                flow += f
        return flow
dic = {"w": 0, "b": 1}
N, M = map(int, input().split())
S = [input() for _ in range(N)]
NM = N * M
E = []
# w:NM, b:NM+1
dinic = Dinic(NM + 2)
WB = [0, 0]
edges = []
for i in range(N):
    for j in range(M):
        s = S[i][j]
        if s == ".":
            continue
        c = dic[s]
        ij = i * M + j
        WB[c] += 1
        if c == 0:
            dinic.add_edge(NM, ij, 1)
        else:
            dinic.add_edge(ij, NM + 1, 1)
        if i < N - 1 and S[i + 1][j] != ".":
            ij2 = (i + 1) * M + j
            if c == 0:
                dinic.add_edge(ij, ij2, 1)
            else:
                dinic.add_edge(ij2, ij, 1)
        if j < M - 1 and S[i][j + 1] != ".":
            ij2 = i * M + j + 1
            if c == 0:
                dinic.add_edge(ij, ij2, 1)
            else:
                dinic.add_edge(ij2, ij, 1)
m = dinic.flow(NM, NM + 1)
ans = abs(WB[0] - WB[1])
ans += 100 * m
ans += 10 * (min(WB) - m)
print(ans)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX