結果
問題 | No.421 しろくろチョコレート |
ユーザー | ああいい |
提出日時 | 2022-02-24 13:21:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 234 ms / 2,000 ms |
コード長 | 3,338 bytes |
コンパイル時間 | 294 ms |
コンパイル使用メモリ | 87,348 KB |
実行使用メモリ | 81,324 KB |
最終ジャッジ日時 | 2023-09-15 06:58:39 |
合計ジャッジ時間 | 11,902 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 91 ms
71,592 KB |
testcase_01 | AC | 176 ms
80,128 KB |
testcase_02 | AC | 122 ms
77,688 KB |
testcase_03 | AC | 102 ms
76,752 KB |
testcase_04 | AC | 110 ms
77,588 KB |
testcase_05 | AC | 123 ms
77,568 KB |
testcase_06 | AC | 98 ms
76,476 KB |
testcase_07 | AC | 151 ms
79,260 KB |
testcase_08 | AC | 110 ms
77,568 KB |
testcase_09 | AC | 117 ms
77,588 KB |
testcase_10 | AC | 110 ms
77,064 KB |
testcase_11 | AC | 154 ms
79,140 KB |
testcase_12 | AC | 91 ms
71,544 KB |
testcase_13 | AC | 91 ms
71,588 KB |
testcase_14 | AC | 89 ms
71,580 KB |
testcase_15 | AC | 90 ms
71,548 KB |
testcase_16 | AC | 197 ms
80,728 KB |
testcase_17 | AC | 202 ms
81,116 KB |
testcase_18 | AC | 183 ms
80,416 KB |
testcase_19 | AC | 94 ms
71,636 KB |
testcase_20 | AC | 173 ms
79,704 KB |
testcase_21 | AC | 178 ms
79,820 KB |
testcase_22 | AC | 159 ms
79,392 KB |
testcase_23 | AC | 94 ms
71,696 KB |
testcase_24 | AC | 93 ms
71,628 KB |
testcase_25 | AC | 92 ms
71,760 KB |
testcase_26 | AC | 92 ms
71,712 KB |
testcase_27 | AC | 90 ms
71,584 KB |
testcase_28 | AC | 156 ms
79,316 KB |
testcase_29 | AC | 158 ms
79,552 KB |
testcase_30 | AC | 164 ms
80,036 KB |
testcase_31 | AC | 166 ms
80,340 KB |
testcase_32 | AC | 173 ms
79,276 KB |
testcase_33 | AC | 193 ms
81,032 KB |
testcase_34 | AC | 100 ms
77,108 KB |
testcase_35 | AC | 104 ms
77,224 KB |
testcase_36 | AC | 147 ms
79,564 KB |
testcase_37 | AC | 193 ms
80,768 KB |
testcase_38 | AC | 203 ms
80,964 KB |
testcase_39 | AC | 134 ms
78,596 KB |
testcase_40 | AC | 170 ms
80,008 KB |
testcase_41 | AC | 117 ms
77,548 KB |
testcase_42 | AC | 116 ms
77,764 KB |
testcase_43 | AC | 146 ms
79,504 KB |
testcase_44 | AC | 198 ms
80,860 KB |
testcase_45 | AC | 123 ms
77,936 KB |
testcase_46 | AC | 111 ms
76,900 KB |
testcase_47 | AC | 161 ms
79,220 KB |
testcase_48 | AC | 182 ms
80,572 KB |
testcase_49 | AC | 136 ms
78,440 KB |
testcase_50 | AC | 122 ms
77,784 KB |
testcase_51 | AC | 184 ms
80,616 KB |
testcase_52 | AC | 160 ms
79,348 KB |
testcase_53 | AC | 114 ms
77,628 KB |
testcase_54 | AC | 122 ms
78,052 KB |
testcase_55 | AC | 119 ms
77,792 KB |
testcase_56 | AC | 117 ms
77,412 KB |
testcase_57 | AC | 120 ms
77,456 KB |
testcase_58 | AC | 166 ms
79,216 KB |
testcase_59 | AC | 143 ms
79,512 KB |
testcase_60 | AC | 234 ms
81,324 KB |
testcase_61 | AC | 219 ms
81,188 KB |
testcase_62 | AC | 94 ms
71,692 KB |
testcase_63 | AC | 92 ms
71,672 KB |
testcase_64 | AC | 99 ms
77,168 KB |
ソースコード
#Dinic法で最大流を求める #deque のimport が必要 #逆辺追加しなきゃいけないから、 #グラフの構成はadd_edgeで行う #最大流は flow メソッドで from collections import deque class Dinic: def __init__(self,N): self.N = N self.G = [[] for _ in range(N)] self.level = None self.progress = None self.edge = [] 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) self.edge.append(forward) 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) self.edge.append(edge1) def get_edge(self,i): return self.edge[i] # i 回目に追加した辺のポインタを返す # 0-index, 順辺のみ def bfs(self,s,t): self.level = level = [None] * self.N q = deque([s]) level[s] = 0 G = self.G while q: v = q.popleft() lv = level[v] + 1 for w,cap,_ in G[v]: if cap and level[w] is None: level[w] = lv q.append(w) return level[t] is not None def dfs(self,v,t,f): if v == t:return f level = self.level Gv = self.G[v] for i in range(self.progress[v],len(Gv)): self.progress[v] = i w,cap,rev = e = Gv[i] 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 = 1 << 30 G = self.G while self.bfs(s,t): self.progress = [0] * self.N f = inf while f: f = self.dfs(s,t,inf) flow += f return flow def min_cut(self,s): #最小カットを実現する頂点の分割を与える #True なら source側 #False なら sink側 visited = [False for i in range(self.N)] q = deque([s]) while q: now = q.popleft() visited[now] = True for to,cap,_ in self.G[now]: if cap and not visited[to]: visited[to] = True q.append(to) return visited N,M = map(int,input().split()) S = [input() for _ in range(N)] countb = 0 countw = 0 dinic = Dinic(N * M + 2) T = N * M + 1 def f(h,w): return h * M + w + 1 for h in range(N): for w in range(M): if S[h][w] == "w": countw += 1 dinic.add_edge(f(h,w),T,1) elif S[h][w] == "b": countb += 1 dinic.add_edge(0,f(h,w),1) for i,j in [(1,0),(-1,0),(0,1),(0,-1)]: if 0 <= h + i < N and 0 <= w + j < M: if S[h+i][w+j] == "w": dinic.add_edge(f(h,w),f(h+i,w+j),1) match = dinic.flow(0,T) countb -= match countw -= match num = min(countw,countb) countb -= num countw -= num ans = 100 * match + 10 * num + countb + countw print(ans)