結果

問題 No.2713 Just Solitaire
ユーザー rlangevinrlangevin
提出日時 2024-05-22 12:16:12
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 107 ms / 2,000 ms
コード長 5,040 bytes
コンパイル時間 289 ms
コンパイル使用メモリ 82,764 KB
実行使用メモリ 79,840 KB
最終ジャッジ日時 2024-05-22 12:16:17
合計ジャッジ時間 4,377 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
68,424 KB
testcase_01 AC 64 ms
69,720 KB
testcase_02 AC 64 ms
70,204 KB
testcase_03 AC 67 ms
69,712 KB
testcase_04 AC 92 ms
79,056 KB
testcase_05 AC 68 ms
71,356 KB
testcase_06 AC 92 ms
78,912 KB
testcase_07 AC 70 ms
72,352 KB
testcase_08 AC 63 ms
68,928 KB
testcase_09 AC 63 ms
69,196 KB
testcase_10 AC 67 ms
71,748 KB
testcase_11 AC 78 ms
73,756 KB
testcase_12 AC 68 ms
70,216 KB
testcase_13 AC 91 ms
78,508 KB
testcase_14 AC 90 ms
79,004 KB
testcase_15 AC 63 ms
69,784 KB
testcase_16 AC 64 ms
69,032 KB
testcase_17 AC 92 ms
78,612 KB
testcase_18 AC 63 ms
69,324 KB
testcase_19 AC 94 ms
78,864 KB
testcase_20 AC 63 ms
69,016 KB
testcase_21 AC 65 ms
69,168 KB
testcase_22 AC 65 ms
70,196 KB
testcase_23 AC 92 ms
78,732 KB
testcase_24 AC 101 ms
79,304 KB
testcase_25 AC 103 ms
79,336 KB
testcase_26 AC 100 ms
79,304 KB
testcase_27 AC 104 ms
79,296 KB
testcase_28 AC 98 ms
79,740 KB
testcase_29 AC 107 ms
79,304 KB
testcase_30 AC 102 ms
79,176 KB
testcase_31 AC 99 ms
79,840 KB
testcase_32 AC 100 ms
79,604 KB
testcase_33 AC 104 ms
79,604 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.readline

#https://github.com/not522/ac-library-python/blob/master/atcoder/maxflow.py
from typing import NamedTuple, Optional, List, cast

class MFGraph:
    class Edge(NamedTuple):
        src: int
        dst: int
        cap: int
        flow: int

    class _Edge:
        def __init__(self, dst: int, cap: int) -> None:
            self.dst = dst
            self.cap = cap
            self.rev: Optional[MFGraph._Edge] = None

    def __init__(self, n: int) -> None:
        self._n = n
        self._g: List[List[MFGraph._Edge]] = [[] for _ in range(n)]
        self._edges: List[MFGraph._Edge] = []

    def add_edge(self, src: int, dst: int, cap: int) -> int:
        assert 0 <= src < self._n
        assert 0 <= dst < self._n
        assert 0 <= cap
        m = len(self._edges)
        e = MFGraph._Edge(dst, cap)
        re = MFGraph._Edge(src, 0)
        e.rev = re
        re.rev = e
        self._g[src].append(e)
        self._g[dst].append(re)
        self._edges.append(e)
        return m

    def get_edge(self, i: int) -> Edge:
        assert 0 <= i < len(self._edges)
        e = self._edges[i]
        re = cast(MFGraph._Edge, e.rev)
        return MFGraph.Edge(
            re.dst,
            e.dst,
            e.cap + re.cap,
            re.cap
        )

    def edges(self) -> List[Edge]:
        return [self.get_edge(i) for i in range(len(self._edges))]

    def change_edge(self, i: int, new_cap: int, new_flow: int) -> None:
        assert 0 <= i < len(self._edges)
        assert 0 <= new_flow <= new_cap
        e = self._edges[i]
        e.cap = new_cap - new_flow
        assert e.rev is not None
        e.rev.cap = new_flow

    def flow(self, s: int, t: int, flow_limit: Optional[int] = None) -> int:
        assert 0 <= s < self._n
        assert 0 <= t < self._n
        assert s != t
        if flow_limit is None:
            flow_limit = cast(int, sum(e.cap for e in self._g[s]))

        current_edge = [0] * self._n
        level = [0] * self._n

        def fill(arr: List[int], value: int) -> None:
            for i in range(len(arr)):
                arr[i] = value

        def bfs() -> bool:
            fill(level, self._n)
            queue = []
            q_front = 0
            queue.append(s)
            level[s] = 0
            while q_front < len(queue):
                v = queue[q_front]
                q_front += 1
                next_level = level[v] + 1
                for e in self._g[v]:
                    if e.cap == 0 or level[e.dst] <= next_level:
                        continue
                    level[e.dst] = next_level
                    if e.dst == t:
                        return True
                    queue.append(e.dst)
            return False

        def dfs(lim: int) -> int:
            stack = []
            edge_stack: List[MFGraph._Edge] = []
            stack.append(t)
            while stack:
                v = stack[-1]
                if v == s:
                    flow = min(lim, min(e.cap for e in edge_stack))
                    for e in edge_stack:
                        e.cap -= flow
                        assert e.rev is not None
                        e.rev.cap += flow
                    return flow
                next_level = level[v] - 1
                while current_edge[v] < len(self._g[v]):
                    e = self._g[v][current_edge[v]]
                    re = cast(MFGraph._Edge, e.rev)
                    if level[e.dst] != next_level or re.cap == 0:
                        current_edge[v] += 1
                        continue
                    stack.append(e.dst)
                    edge_stack.append(re)
                    break
                else:
                    stack.pop()
                    if edge_stack:
                        edge_stack.pop()
                    level[v] = self._n
            return 0

        flow = 0
        while flow < flow_limit:
            if not bfs():
                break
            fill(current_edge, 0)
            while flow < flow_limit:
                f = dfs(flow_limit - flow)
                flow += f
                if f == 0:
                    break
        return flow

    def min_cut(self, s: int) -> List[bool]:
        visited = [False] * self._n
        stack = [s]
        visited[s] = True
        while stack:
            v = stack.pop()
            for e in self._g[v]:
                if e.cap > 0 and not visited[e.dst]:
                    visited[e.dst] = True
                    stack.append(e.dst)
        return visited
    

N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
offset = sum(B)

G = MFGraph(N + M + 2)
s = N + M
g = s + 1
inf = 10 ** 18
for i in range(N):
    G.add_edge(i, g, A[i])
for i in range(M):
    G.add_edge(s, N + i, B[i])
for i in range(M):
    C = list(map(int, input().split()))
    K = C.pop(0)
    for j in range(K):
        G.add_edge(N + i, C[j]-1, inf)
        
print(offset - G.flow(s, g))
0