結果

問題 No.1678 Coin Trade (Multiple)
ユーザー aaaaaaaaaa2230aaaaaaaaaa2230
提出日時 2021-12-09 23:03:24
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,760 bytes
コンパイル時間 177 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 268,300 KB
最終ジャッジ日時 2024-07-17 16:00:06
合計ジャッジ時間 35,351 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
55,008 KB
testcase_01 AC 40 ms
53,376 KB
testcase_02 AC 42 ms
53,760 KB
testcase_03 AC 651 ms
114,528 KB
testcase_04 AC 3,067 ms
227,228 KB
testcase_05 AC 1,268 ms
151,712 KB
testcase_06 AC 1,017 ms
136,048 KB
testcase_07 AC 2,652 ms
212,036 KB
testcase_08 AC 1,830 ms
170,876 KB
testcase_09 AC 1,379 ms
157,056 KB
testcase_10 AC 479 ms
99,200 KB
testcase_11 AC 2,116 ms
190,312 KB
testcase_12 AC 472 ms
101,376 KB
testcase_13 AC 4,671 ms
264,748 KB
testcase_14 AC 1,369 ms
152,716 KB
testcase_15 AC 1,590 ms
163,972 KB
testcase_16 AC 577 ms
112,720 KB
testcase_17 AC 1,492 ms
157,552 KB
testcase_18 AC 61 ms
66,432 KB
testcase_19 AC 42 ms
53,760 KB
testcase_20 AC 48 ms
60,928 KB
testcase_21 AC 55 ms
64,256 KB
testcase_22 AC 53 ms
64,256 KB
testcase_23 AC 50 ms
62,080 KB
testcase_24 AC 60 ms
66,176 KB
testcase_25 AC 42 ms
54,400 KB
testcase_26 AC 57 ms
65,152 KB
testcase_27 AC 50 ms
62,592 KB
testcase_28 AC 52 ms
62,976 KB
testcase_29 AC 42 ms
54,260 KB
testcase_30 AC 48 ms
60,672 KB
testcase_31 AC 43 ms
54,528 KB
testcase_32 AC 42 ms
53,376 KB
testcase_33 AC 61 ms
66,304 KB
testcase_34 AC 54 ms
64,256 KB
testcase_35 AC 42 ms
54,400 KB
testcase_36 AC 61 ms
66,944 KB
testcase_37 AC 62 ms
67,840 KB
testcase_38 AC 52 ms
62,848 KB
testcase_39 AC 47 ms
60,288 KB
testcase_40 AC 59 ms
65,152 KB
testcase_41 AC 59 ms
64,512 KB
testcase_42 AC 64 ms
67,328 KB
testcase_43 AC 70 ms
68,352 KB
testcase_44 AC 51 ms
59,648 KB
testcase_45 AC 43 ms
53,888 KB
testcase_46 AC 66 ms
67,740 KB
testcase_47 AC 54 ms
62,336 KB
testcase_48 TLE -
testcase_49 -- -
testcase_50 -- -
testcase_51 -- -
testcase_52 -- -
testcase_53 -- -
testcase_54 -- -
testcase_55 -- -
testcase_56 -- -
testcase_57 -- -
testcase_58 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.readline
from heapq import heappush, heappop

class mincostflow:

    class edge:
        def __init__(self, from_, to, cap, flow, cost):
            self.from_ = from_
            self.to = to
            self.cap = cap
            self.flow = flow
            self.cost = cost
    class _edge:
        def __init__(self, to, rev, cap, cost):
            self.to = to
            self.rev = rev
            self.cap = cap
            self.cost = cost

    def __init__(self, n):
        self.n = n
        self.pos = []
        self.g = [[] for i in range(n)]

    def add_edge(self, from_, to, cap, cost):
        m = len(self.pos)
        self.pos.append((from_, len(self.g[from_])))
        self.g[from_].append(self.__class__._edge(to, len(self.g[to]), cap, cost))
        self.g[to].append(self.__class__._edge(from_, len(self.g[from_])-1, 0, -cost))
        return m

    def get_edge(self, i):
        _e = self.g[self.pos[i][0]][self.pos[i][1]]
        _re = self.g[_e.to][_e.rev]
        return self.edge(self.pos[i][0], _e.to, _e.cap + _re.cap, _re.cap, _e.cost)

    def edges(self):
        result = []
        for i in range(len(self.pos)):
            result.append(self.get_edge(i))
        return result

    def slope(self, s, t, flow_limit=10**20, inf=10**20):
        dual = [0]*self.n
        dist = [inf]*self.n
        pv = [-1]*self.n
        pe = [-1]*self.n
        vis = [False]*self.n

        def _dual_ref():
            nonlocal dual, dist, pv, pe, vis
            dist = [inf]*self.n
            pv = [-1]*self.n
            pe = [-1]*self.n
            vis = [False]*self.n

            que = [(0,s)]
            dist[s] = 0
            while que:
                _,v = heappop(que)
                if vis[v]:
                    continue
                vis[v] = True

                if v == t:
                    break
                for i in range(len(self.g[v])):
                    e = self.g[v][i]
                    if vis[e.to] or e.cap == 0:
                        continue
                    cost = e.cost - dual[e.to] + dual[v]
                    if dist[e.to] > dist[v] + cost:
                        dist[e.to] = dist[v] + cost
                        pv[e.to] = v
                        pe[e.to] = i
                        heappush(que, (dist[e.to],e.to))
            if not vis[t]:
                return False

            for v in range(self.n):
                if not vis[v]:
                    continue
                dual[v] -= dist[t] - dist[v]
            return True
        
        flow = 0
        cost = 0
        prev_cost = -1

        result = [(flow, cost)]
        while flow < flow_limit:
            if not _dual_ref():
                break
            c = flow_limit - flow
            v = t
            while v != s:
                c = min(c, self.g[pv[v]][pe[v]].cap)
                v = pv[v]

            v = t
            while v != s:
                e = self.g[pv[v]][pe[v]]
                e.cap -= c
                self.g[v][e.rev].cap += c
                v = pv[v]
            
            d = -dual[s]
            flow += c
            cost += c * d
            if prev_cost == d:
                result.pop()
            result.append((flow, cost))
            prev_cost = cost
        return result

    def flow(self, s, t, flow_limit=10**20):
        return self.slope(s, t, flow_limit)[-1]
    

n,k = map(int,input().split())
g = mincostflow(n+1)
A = [0]
M = 10**9
for i in range(1,n+1):
    a,m = map(int,input().split())
    A.append(a)
    B = list(map(int,input().split()))
    for b in B:
        g.add_edge(b,i,1,A[b]-a+(i-b)*M)
    
    if i > 1:
        g.add_edge(i-1,i,k,M)

ans = g.flow(1,n,k)
print((n-1)*k*M-ans[1])
0