結果
問題 | No.2713 Just Solitaire |
ユーザー | sepa38 |
提出日時 | 2024-03-31 12:34:15 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 99 ms / 2,000 ms |
コード長 | 1,999 bytes |
コンパイル時間 | 3,719 ms |
コンパイル使用メモリ | 81,444 KB |
実行使用メモリ | 77,760 KB |
最終ジャッジ日時 | 2024-03-31 12:34:26 |
合計ジャッジ時間 | 4,290 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
55,480 KB |
testcase_01 | AC | 43 ms
55,480 KB |
testcase_02 | AC | 43 ms
55,480 KB |
testcase_03 | AC | 77 ms
75,844 KB |
testcase_04 | AC | 70 ms
72,800 KB |
testcase_05 | AC | 54 ms
63,540 KB |
testcase_06 | AC | 89 ms
77,024 KB |
testcase_07 | AC | 52 ms
63,400 KB |
testcase_08 | AC | 43 ms
55,480 KB |
testcase_09 | AC | 46 ms
61,028 KB |
testcase_10 | AC | 54 ms
63,660 KB |
testcase_11 | AC | 60 ms
67,968 KB |
testcase_12 | AC | 52 ms
63,552 KB |
testcase_13 | AC | 78 ms
74,072 KB |
testcase_14 | AC | 66 ms
70,732 KB |
testcase_15 | AC | 42 ms
55,480 KB |
testcase_16 | AC | 48 ms
61,412 KB |
testcase_17 | AC | 63 ms
68,636 KB |
testcase_18 | AC | 43 ms
55,480 KB |
testcase_19 | AC | 91 ms
77,136 KB |
testcase_20 | AC | 42 ms
55,480 KB |
testcase_21 | AC | 43 ms
55,480 KB |
testcase_22 | AC | 50 ms
63,548 KB |
testcase_23 | AC | 67 ms
70,712 KB |
testcase_24 | AC | 75 ms
72,764 KB |
testcase_25 | AC | 96 ms
77,632 KB |
testcase_26 | AC | 90 ms
77,520 KB |
testcase_27 | AC | 92 ms
77,632 KB |
testcase_28 | AC | 93 ms
77,640 KB |
testcase_29 | AC | 91 ms
77,632 KB |
testcase_30 | AC | 92 ms
77,760 KB |
testcase_31 | AC | 80 ms
74,560 KB |
testcase_32 | AC | 99 ms
77,632 KB |
testcase_33 | AC | 92 ms
77,520 KB |
ソースコード
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 n, m = map(int, input().split()) a = list(map(int, input().split())) b = list(map(int, input().split())) c = [] for _ in range(m): c.append(list(map(lambda x: int(x)-1, input().split()))[1:]) g = Dinic(n+m+2) inf = 1 << 30 for i in range(n): g.add_edge(0, i+1, a[i]) for i in range(m): g.add_edge(n+i+1, n+m+1, b[i]) for v in range(m): for u in c[v]: g.add_edge(u+1, n+v+1, inf) print(sum(b) - g.flow(0, n+m+1))