#883318 (Python3) No.1984 [Cherry 4th Tune *] Dilemma

提出ソース

結果

問題	No.1984 [Cherry 4th Tune *] Dilemma
ユーザー	vwxyz
提出日時	2023-06-21 17:56:47
言語	Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果	AC
実行時間	59 ms / 2,000 ms
コード長	5,455 bytes
コンパイル時間	163 ms
コンパイル使用メモリ	13,312 KB
実行使用メモリ	13,044 KB
最終ジャッジ日時	2024-06-29 03:25:50
合計ジャッジ時間	8,652 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	42 ms 11,768 KB
testcase_01	AC	41 ms 11,768 KB
testcase_02	AC	40 ms 11,764 KB
testcase_03	AC	40 ms 11,896 KB
testcase_04	AC	38 ms 11,772 KB
testcase_05	AC	37 ms 11,764 KB
testcase_06	AC	38 ms 11,896 KB
testcase_07	AC	40 ms 11,768 KB
testcase_08	AC	38 ms 11,900 KB
testcase_09	AC	40 ms 11,768 KB
testcase_10	AC	40 ms 11,896 KB
testcase_11	AC	40 ms 11,764 KB
testcase_12	AC	40 ms 11,896 KB
testcase_13	AC	42 ms 11,892 KB
testcase_14	AC	46 ms 12,404 KB
testcase_15	AC	42 ms 11,896 KB
testcase_16	AC	44 ms 12,408 KB
testcase_17	AC	46 ms 12,152 KB
testcase_18	AC	44 ms 12,020 KB
testcase_19	AC	41 ms 12,148 KB
testcase_20	AC	38 ms 11,892 KB
testcase_21	AC	42 ms 12,152 KB
testcase_22	AC	47 ms 12,280 KB
testcase_23	AC	49 ms 12,664 KB
testcase_24	AC	52 ms 12,408 KB
testcase_25	AC	51 ms 12,536 KB
testcase_26	AC	47 ms 12,404 KB
testcase_27	AC	50 ms 12,536 KB
testcase_28	AC	53 ms 12,540 KB
testcase_29	AC	48 ms 12,404 KB
testcase_30	AC	55 ms 12,920 KB
testcase_31	AC	49 ms 12,284 KB
testcase_32	AC	48 ms 12,408 KB
testcase_33	AC	40 ms 12,020 KB
testcase_34	AC	41 ms 12,020 KB
testcase_35	AC	41 ms 11,892 KB
testcase_36	AC	40 ms 11,896 KB
testcase_37	AC	41 ms 11,896 KB
testcase_38	AC	41 ms 11,896 KB
testcase_39	AC	39 ms 12,020 KB
testcase_40	AC	41 ms 11,900 KB
testcase_41	AC	40 ms 12,024 KB
testcase_42	AC	41 ms 11,768 KB
testcase_43	AC	42 ms 12,020 KB
testcase_44	AC	42 ms 12,020 KB
testcase_45	AC	40 ms 12,020 KB
testcase_46	AC	41 ms 12,020 KB
testcase_47	AC	45 ms 12,024 KB
testcase_48	AC	41 ms 12,024 KB
testcase_49	AC	39 ms 11,896 KB
testcase_50	AC	40 ms 11,892 KB
testcase_51	AC	41 ms 12,020 KB
testcase_52	AC	42 ms 11,892 KB
testcase_53	AC	41 ms 12,024 KB
testcase_54	AC	41 ms 12,020 KB
testcase_55	AC	42 ms 11,896 KB
testcase_56	AC	42 ms 11,896 KB
testcase_57	AC	40 ms 11,768 KB
testcase_58	AC	42 ms 11,892 KB
testcase_59	AC	44 ms 11,892 KB
testcase_60	AC	42 ms 12,148 KB
testcase_61	AC	43 ms 12,020 KB
testcase_62	AC	44 ms 12,020 KB
testcase_63	AC	59 ms 13,044 KB
testcase_64	AC	49 ms 12,408 KB
testcase_65	AC	48 ms 12,536 KB
testcase_66	AC	38 ms 11,892 KB
testcase_67	AC	39 ms 11,768 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

import sys
readline=sys.stdin.readline
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,K,P=map(int,readline().split())
E=list(map(int,readline().split()))
F=list(map(int,readline().split()))
V=list(map(int,readline().split()))
MFG=MFGraph(N+M+K+2)
s=0
t=N+M+K+1
inf=1<<60
ans=0
for n in range(N):
    L,*A=map(int,readline().split())
    for l in range(L):
        A[l]-=1
        MFG.add_edge(1+N+M+A[l],1+n,inf)
    ans+=E[n]
    MFG.add_edge(1+n,t,E[n])
for m in range(M):
    ans+=F[m]
    MFG.add_edge(s,1+N+m,F[m])
for k in range(K):
    MFG.add_edge(s,1+N+M+k,V[k])
for p in range(P):
    i,j=map(int,readline().split())
    i-=1;j-=1
    MFG.add_edge(1+N+j,1+i,inf)
ans-=MFG.flow(s,t)
lst=MFG.min_cut(s)
ans_lst=[]
for k in range(K):
    if not lst[1+N+M+k]:
        ans_lst.append(("Preparation",k+1))
for n in range(N):
    if not lst[1+n]:
        ans_lst.append(("Goal",n+1))
for m in range(M):
    if lst[1+N+m]:
        ans_lst.append(("Action",m+1))
print(ans)
print(len(ans_lst))
for s,x in ans_lst:
    print(s,x)

yukicoder

結果

テストケース

ソースコード