結果

問題 No.2713 Just Solitaire
ユーザー lam6er
提出日時 2025-03-20 18:57:04
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 104 ms / 2,000 ms
コード長 3,140 bytes
コンパイル時間 173 ms
コンパイル使用メモリ 83,036 KB
実行使用メモリ 78,732 KB
最終ジャッジ日時 2025-03-20 18:58:26
合計ジャッジ時間 3,755 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import deque

class Edge:
    def __init__(self, to, rev, capacity):
        self.to = to
        self.rev = rev
        self.capacity = capacity

class MaxFlow:
    def __init__(self, n):
        self.size = n
        self.graph = [[] for _ in range(n)]
    
    def add_edge(self, fr, to, cap):
        forward = Edge(to, len(self.graph[to]), cap)
        backward = Edge(fr, len(self.graph[fr]), 0)
        self.graph[fr].append(forward)
        self.graph[to].append(backward)
    
    def bfs_level(self, s, t, level):
        q = deque()
        level[:] = [-1] * self.size
        level[s] = 0
        q.append(s)
        while q:
            v = q.popleft()
            for edge in self.graph[v]:
                if edge.capacity > 0 and level[edge.to] == -1:
                    level[edge.to] = level[v] + 1
                    q.append(edge.to)
                    if edge.to == t:
                        return
    
    def dfs_flow(self, v, t, upTo, iter_, level):
        if v == t:
            return upTo
        for i in range(iter_[v], len(self.graph[v])):
            edge = self.graph[v][i]
            if edge.capacity > 0 and level[v] < level[edge.to]:
                d = self.dfs_flow(edge.to, t, min(upTo, edge.capacity), iter_, level)
                if d > 0:
                    edge.capacity -= d
                    self.graph[edge.to][edge.rev].capacity += d
                    return d
            iter_[v] += 1
        return 0
    
    def max_flow(self, s, t):
        flow = 0
        level = [-1] * self.size
        while True:
            self.bfs_level(s, t, level)
            if level[t] == -1:
                return flow
            iter_ = [0] * self.size
            while True:
                f = self.dfs_flow(s, t, float('inf'), iter_, level)
                if f == 0:
                    break
                flow += f
            level = [-1] * self.size

def main():
    import sys
    input = sys.stdin.read
    data = input().split()
    idx = 0
    N = int(data[idx])
    M = int(data[idx + 1])
    idx +=2
    
    A = list(map(int, data[idx:idx+N]))
    idx +=N
    
    B = list(map(int, data[idx:idx+M]))
    idx +=M
    
    bonuses = []
    for _ in range(M):
        K_i = int(data[idx])
        C_i = list(map(int, data[idx +1 : idx+1+K_i]))
        bonuses.append( (K_i, C_i) )
        idx +=1 + K_i
    
    sum_b = sum(B)
    INF = 1e18
    
    # Nodes:
    # source = 0
    # bonuses 1..M
    # cards M+1 ... M+N
    # sink = M + N + 1
    s = 0
    t = M + N + 1
    size = t +1
    
    mf = MaxFlow(size)
    
    for i in range(M):
        cap = B[i]
        mf.add_edge(s, i+1, cap)
        mf.add_edge(i+1, t, 0)
    
    for j in range(N):
        card_node = M +1 + j
        cap = A[j]
        mf.add_edge(card_node, t, cap)
        mf.add_edge(s, card_node, 0)
    
    for i in range(M):
        K_i, C_list = bonuses[i]
        for c in C_list:
            card_node = M + c
            mf.add_edge(i+1, card_node, INF)
    
    max_flow = mf.max_flow(s, t)
    ans = sum_b - max_flow
    print(ans)

if __name__ == "__main__":
    main()
0