結果

問題 No.1678 Coin Trade (Multiple)
ユーザー tamatotamato
提出日時 2021-09-10 22:22:27
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 4,285 ms / 5,000 ms
コード長 2,640 bytes
コンパイル時間 913 ms
コンパイル使用メモリ 82,960 KB
実行使用メモリ 245,396 KB
最終ジャッジ日時 2024-06-12 00:59:35
合計ジャッジ時間 64,747 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
53,248 KB
testcase_01 AC 34 ms
53,248 KB
testcase_02 AC 54 ms
53,376 KB
testcase_03 AC 473 ms
96,264 KB
testcase_04 AC 2,085 ms
139,608 KB
testcase_05 AC 873 ms
117,420 KB
testcase_06 AC 649 ms
109,824 KB
testcase_07 AC 1,867 ms
132,956 KB
testcase_08 AC 1,234 ms
118,328 KB
testcase_09 AC 884 ms
118,176 KB
testcase_10 AC 509 ms
88,172 KB
testcase_11 AC 1,431 ms
126,432 KB
testcase_12 AC 429 ms
88,860 KB
testcase_13 AC 3,244 ms
167,168 KB
testcase_14 AC 1,033 ms
111,096 KB
testcase_15 AC 1,151 ms
117,760 KB
testcase_16 AC 352 ms
98,084 KB
testcase_17 AC 941 ms
118,128 KB
testcase_18 AC 48 ms
64,256 KB
testcase_19 AC 36 ms
53,248 KB
testcase_20 AC 49 ms
53,888 KB
testcase_21 AC 47 ms
61,952 KB
testcase_22 AC 49 ms
63,360 KB
testcase_23 AC 36 ms
54,144 KB
testcase_24 AC 49 ms
63,872 KB
testcase_25 AC 35 ms
53,632 KB
testcase_26 AC 43 ms
61,824 KB
testcase_27 AC 38 ms
54,172 KB
testcase_28 AC 41 ms
59,264 KB
testcase_29 AC 39 ms
53,120 KB
testcase_30 AC 49 ms
61,568 KB
testcase_31 AC 38 ms
53,504 KB
testcase_32 AC 36 ms
53,248 KB
testcase_33 AC 50 ms
65,280 KB
testcase_34 AC 40 ms
59,904 KB
testcase_35 AC 35 ms
53,760 KB
testcase_36 AC 56 ms
66,176 KB
testcase_37 AC 55 ms
66,560 KB
testcase_38 AC 38 ms
53,632 KB
testcase_39 AC 36 ms
53,376 KB
testcase_40 AC 47 ms
63,232 KB
testcase_41 AC 43 ms
60,928 KB
testcase_42 AC 52 ms
64,896 KB
testcase_43 AC 58 ms
68,224 KB
testcase_44 AC 37 ms
53,632 KB
testcase_45 AC 36 ms
53,376 KB
testcase_46 AC 55 ms
66,816 KB
testcase_47 AC 40 ms
59,904 KB
testcase_48 AC 3,982 ms
190,404 KB
testcase_49 AC 3,894 ms
187,840 KB
testcase_50 AC 3,975 ms
189,272 KB
testcase_51 AC 4,038 ms
192,520 KB
testcase_52 AC 3,899 ms
190,200 KB
testcase_53 AC 3,940 ms
192,684 KB
testcase_54 AC 4,285 ms
191,616 KB
testcase_55 AC 4,122 ms
189,956 KB
testcase_56 AC 3,983 ms
189,924 KB
testcase_57 AC 3,947 ms
190,476 KB
testcase_58 AC 3,118 ms
245,396 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.buffer.readline
    from heapq import heappush, heappop

    class Mincostflow():
        def __init__(self, N):
            self.N = N
            self.adj = [[] for _ in range(N + 1)]
            self.inf = 1 << 60

        def add_edge(self, fr, to, cap, cost):
            # [to, cap, cost, rev]
            forward = [to, cap, cost, None]
            backward = forward[3] = [fr, 0, -cost, forward]
            self.adj[fr].append(forward)
            self.adj[to].append(backward)

        def flow(self, s, t, f):
            N = self.N
            adj = self.adj
            inf = self.inf

            res = 0
            H = [0] * (N + 1)
            prev_v = [0] * (N + 1)
            prev_e = [None] * (N + 1)

            dist0 = [inf] * (N + 1)
            dist = [inf] * (N + 1)

            while f:
                dist[:] = dist0
                dist[s] = 0
                pq = [(0, s)]
                while pq:
                    d, v = heappop(pq)
                    if d > dist[v]:
                        continue
                    r0 = dist[v] + H[v]
                    for e in adj[v]:
                        u, cap, cost, _ = e
                        if cap > 0 and r0 + cost - H[u] < dist[u]:
                            dist[u] = r = r0 + cost - H[u]
                            heappush(pq, (r, u))
                            prev_v[u] = v
                            prev_e[u] = e

                # flow f doesn't exist
                if dist[t] == inf:
                    return None

                for i in range(1, N + 1):
                    H[i] += dist[i]

                g = f
                v = t
                while v != s:
                    g = min(g, prev_e[v][1])
                    v = prev_v[v]
                f -= g
                res += g * H[t]
                v = t
                while v != s:
                    e = prev_e[v]
                    e[1] -= g
                    e[-1][1] += g
                    v = prev_v[v]

            return res

    N, K = map(int, input().split())
    mcf = Mincostflow(N + 2)
    s = N + 2
    t = N + 1
    L = 10 ** 10
    mcf.add_edge(s, 1, K, L)
    A = [0] * (N+1)
    for i in range(1, N+1):
        a, M = map(int, input().split())
        A[i] = a
        B = list(map(int, input().split()))
        mcf.add_edge(i, i+1, K, L)
        for b in B:
            if a - A[b] > 0:
                mcf.add_edge(b, i, 1, L * (i - b) - (a - A[b]))
    f = mcf.flow(s, t, K)
    print(L * (N + 1) * K - f)


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