結果

問題 No.1678 Coin Trade (Multiple)
ユーザー convexineqconvexineq
提出日時 2021-09-10 23:07:46
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 4,736 bytes
コンパイル時間 583 ms
コンパイル使用メモリ 87,220 KB
実行使用メモリ 265,448 KB
最終ジャッジ日時 2023-09-02 21:13:37
合計ジャッジ時間 39,864 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 171 ms
80,776 KB
testcase_01 AC 170 ms
80,740 KB
testcase_02 AC 174 ms
80,708 KB
testcase_03 AC 756 ms
111,300 KB
testcase_04 AC 2,901 ms
222,800 KB
testcase_05 AC 1,356 ms
149,436 KB
testcase_06 AC 1,045 ms
134,228 KB
testcase_07 AC 2,290 ms
195,340 KB
testcase_08 AC 1,755 ms
161,092 KB
testcase_09 AC 1,463 ms
154,036 KB
testcase_10 AC 649 ms
94,620 KB
testcase_11 AC 2,073 ms
185,388 KB
testcase_12 AC 591 ms
96,276 KB
testcase_13 AC 4,555 ms
265,364 KB
testcase_14 AC 1,470 ms
141,888 KB
testcase_15 AC 1,586 ms
158,100 KB
testcase_16 AC 673 ms
110,088 KB
testcase_17 AC 1,526 ms
156,636 KB
testcase_18 AC 181 ms
82,540 KB
testcase_19 AC 163 ms
80,712 KB
testcase_20 AC 169 ms
80,728 KB
testcase_21 AC 176 ms
81,864 KB
testcase_22 AC 180 ms
81,864 KB
testcase_23 AC 171 ms
80,580 KB
testcase_24 AC 179 ms
82,304 KB
testcase_25 AC 169 ms
80,828 KB
testcase_26 AC 180 ms
82,668 KB
testcase_27 AC 167 ms
80,788 KB
testcase_28 AC 176 ms
81,620 KB
testcase_29 AC 169 ms
80,708 KB
testcase_30 AC 172 ms
81,136 KB
testcase_31 AC 172 ms
80,708 KB
testcase_32 AC 171 ms
80,472 KB
testcase_33 AC 181 ms
82,364 KB
testcase_34 AC 171 ms
80,880 KB
testcase_35 AC 169 ms
80,708 KB
testcase_36 AC 179 ms
82,368 KB
testcase_37 AC 181 ms
82,280 KB
testcase_38 AC 166 ms
80,712 KB
testcase_39 AC 169 ms
80,764 KB
testcase_40 AC 177 ms
82,604 KB
testcase_41 AC 179 ms
82,720 KB
testcase_42 AC 181 ms
82,104 KB
testcase_43 AC 185 ms
82,860 KB
testcase_44 AC 168 ms
80,708 KB
testcase_45 AC 169 ms
80,724 KB
testcase_46 AC 186 ms
82,560 KB
testcase_47 AC 177 ms
81,660 KB
testcase_48 TLE -
testcase_49 TLE -
testcase_50 TLE -
testcase_51 TLE -
testcase_52 TLE -
testcase_53 TLE -
testcase_54 TLE -
testcase_55 TLE -
testcase_56 -- -
testcase_57 -- -
testcase_58 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


class MCFGraph:
    class Edge(NamedTuple):
        src: int
        dst: int
        cap: int
        flow: int
        cost: int

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

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

    def add_edge(self, src: int, dst: int, cap: int, cost: int) -> int:
        assert 0 <= src < self._n
        assert 0 <= dst < self._n
        assert 0 <= cap
        m = len(self._edges)
        e = MCFGraph._Edge(dst, cap, cost)
        re = MCFGraph._Edge(src, 0, -cost)
        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(MCFGraph._Edge, e.rev)
        return MCFGraph.Edge(
            re.dst,
            e.dst,
            e.cap + re.cap,
            re.cap,
            e.cost
        )

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

    def flow(self, s: int, t: int,
             flow_limit: Optional[int] = None) -> Tuple[int, int]:
        return self.slope(s, t, flow_limit)[-1]

    def slope(self, s: int, t: int,
              flow_limit: Optional[int] = None) -> List[Tuple[int, 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]))

        dual = [0] * self._n
        prev: List[Optional[Tuple[int, MCFGraph._Edge]]] = [None] * self._n

        def refine_dual() -> bool:
            pq = [(0, s)]
            visited = [False] * self._n
            dist: List[Optional[int]] = [None] * self._n
            dist[s] = 0
            while pq:
                dist_v, v = heappop(pq)
                if visited[v]:
                    continue
                visited[v] = True
                if v == t:
                    break
                dual_v = dual[v]
                for e in self._g[v]:
                    w = e.dst
                    if visited[w] or e.cap == 0:
                        continue
                    reduced_cost = e.cost - dual[w] + dual_v
                    new_dist = dist_v + reduced_cost
                    dist_w = dist[w]
                    if dist_w is None or new_dist < dist_w:
                        dist[w] = new_dist
                        prev[w] = v, e
                        heappush(pq, (new_dist, w))
            else:
                return False
            dist_t = dist[t]
            for v in range(self._n):
                if visited[v]:
                    dual[v] -= cast(int, dist_t) - cast(int, dist[v])
            return True

        flow = 0
        cost = 0
        prev_cost_per_flow: Optional[int] = None
        result = [(flow, cost)]
        while flow < flow_limit:
            if not refine_dual():
                break
            f = flow_limit - flow
            v = t
            while prev[v] is not None:
                u, e = cast(Tuple[int, MCFGraph._Edge], prev[v])
                f = min(f, e.cap)
                v = u
            v = t
            while prev[v] is not None:
                u, e = cast(Tuple[int, MCFGraph._Edge], prev[v])
                e.cap -= f
                assert e.rev is not None
                e.rev.cap += f
                v = u
            c = -dual[s]
            flow += f
            cost += f * c
            if c == prev_cost_per_flow:
                result.pop()
            result.append((flow, cost))
            prev_cost_per_flow = c
        return result


import sys
readline = sys.stdin.readline
n,k = map(int,readline().split())
a = [0]*n
S,T = n,n+1

INF = 1<<30
g = MCFGraph(n+2)
#g.add_edge(src: int, dst: int, cap: int, cost: int) -> int:
g.add_edge(S,0,k,0)
g.add_edge(n-1,T,k,0)
for i in range(n-1):
    g.add_edge(i,i+1,k,INF)

for i in range(n):
    a[i],_ = map(int,input().split())
    *b, = map(int,input().split())
    for bi in b:
        bi -= 1
        # bi -> i 矢印
        gain = a[i] - a[bi]
        if gain > 0:
            g.add_edge(bi,i,1,INF*(i-bi)-gain)

res = g.flow(S,T,k)
print(INF*(n-1)*k - res[1])
0