結果
問題 | No.1678 Coin Trade (Multiple) |
ユーザー | chineristAC |
提出日時 | 2021-09-10 22:41:28 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,892 bytes |
コンパイル時間 | 268 ms |
コンパイル使用メモリ | 87,328 KB |
実行使用メモリ | 231,648 KB |
最終ジャッジ日時 | 2023-09-02 19:38:03 |
合計ジャッジ時間 | 28,655 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 93 ms
76,820 KB |
testcase_01 | AC | 91 ms
72,084 KB |
testcase_02 | AC | 93 ms
72,164 KB |
testcase_03 | AC | 752 ms
112,052 KB |
testcase_04 | AC | 3,540 ms
183,272 KB |
testcase_05 | AC | 1,334 ms
134,972 KB |
testcase_06 | AC | 1,035 ms
126,812 KB |
testcase_07 | AC | 3,367 ms
181,120 KB |
testcase_08 | AC | 2,175 ms
151,160 KB |
testcase_09 | AC | 1,449 ms
140,020 KB |
testcase_10 | AC | 1,027 ms
101,680 KB |
testcase_11 | AC | 2,520 ms
159,620 KB |
testcase_12 | AC | 955 ms
104,968 KB |
testcase_13 | TLE | - |
testcase_14 | AC | 1,874 ms
144,420 KB |
testcase_15 | AC | 1,830 ms
144,592 KB |
testcase_16 | AC | 463 ms
110,072 KB |
testcase_17 | AC | 1,487 ms
140,288 KB |
testcase_18 | AC | 106 ms
77,216 KB |
testcase_19 | AC | 88 ms
71,996 KB |
testcase_20 | AC | 94 ms
73,004 KB |
testcase_21 | AC | 101 ms
77,396 KB |
testcase_22 | AC | 106 ms
77,936 KB |
testcase_23 | AC | 99 ms
77,080 KB |
testcase_24 | AC | 111 ms
78,136 KB |
testcase_25 | AC | 94 ms
72,292 KB |
testcase_26 | AC | 106 ms
77,352 KB |
testcase_27 | AC | 99 ms
76,896 KB |
testcase_28 | AC | 99 ms
77,060 KB |
testcase_29 | AC | 91 ms
72,080 KB |
testcase_30 | AC | 97 ms
76,836 KB |
testcase_31 | AC | 92 ms
72,380 KB |
testcase_32 | AC | 89 ms
72,416 KB |
testcase_33 | AC | 108 ms
77,956 KB |
testcase_34 | AC | 93 ms
72,652 KB |
testcase_35 | AC | 91 ms
72,564 KB |
testcase_36 | AC | 113 ms
77,524 KB |
testcase_37 | AC | 118 ms
77,872 KB |
testcase_38 | AC | 100 ms
77,136 KB |
testcase_39 | AC | 101 ms
77,796 KB |
testcase_40 | AC | 104 ms
77,676 KB |
testcase_41 | AC | 100 ms
77,580 KB |
testcase_42 | AC | 116 ms
78,056 KB |
testcase_43 | AC | 114 ms
77,900 KB |
testcase_44 | AC | 100 ms
77,824 KB |
testcase_45 | AC | 89 ms
72,004 KB |
testcase_46 | AC | 118 ms
77,924 KB |
testcase_47 | AC | 104 ms
77,440 KB |
testcase_48 | TLE | - |
testcase_49 | -- | - |
testcase_50 | -- | - |
testcase_51 | -- | - |
testcase_52 | -- | - |
testcase_53 | -- | - |
testcase_54 | -- | - |
testcase_55 | -- | - |
testcase_56 | -- | - |
testcase_57 | -- | - |
testcase_58 | -- | - |
ソースコード
from heapq import heappush, heappop class MinCostFlow: INF = 10**18 def __init__(self, N): self.N = N self.G = [[] for i in range(N)] def add_edge(self, fr, to, cap, cost): forward = [to, cap, cost, None] backward = forward[3] = [fr, 0, -cost, forward] self.G[fr].append(forward) self.G[to].append(backward) def flow(self, s, t, f,first=False): N = self.N; G = self.G INF = MinCostFlow.INF res = 0 H = [0]*N prv_v = [0]*N prv_e = [None]*N d0 = [INF]*N dist = [INF]*N while f: if first: first = False dist[s] = 0 for v in range(N): for e in self.G[v]: nv,cap,cost,_ = e if cap > 0 and dist[v] + cost < dist[nv]: dist[nv] = dist[v] + cost prv_e[nv] = e prv_v[nv] = v for i in range(N): H[i] += dist[i] d = f; v = t while v != s: d = min(d, prv_e[v][1]) v = prv_v[v] f -= d res += d * H[t] v = t while v != s: e = prv_e[v] e[1] -= d e[3][1] += d v = prv_v[v] continue dist[:] = d0 dist[s] = 0 que = [(0, s)] while que: c, v = heappop(que) if dist[v] < c: continue r0 = dist[v] + H[v] for e in G[v]: w, cap, cost, _ = e if cap > 0 and r0 + cost - H[w] < dist[w]: dist[w] = r = r0 + cost - H[w] prv_v[w] = v; prv_e[w] = e heappush(que, (r, w)) if dist[t] == INF: return None for i in range(N): H[i] += dist[i] d = f; v = t while v != s: d = min(d, prv_e[v][1]) v = prv_v[v] f -= d res += d * H[t] v = t while v != s: e = prv_e[v] e[1] -= d e[3][1] += d v = prv_v[v] return res import sys,random input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) N,K = mi() G = MinCostFlow(N) A = [0 for i in range(N)] for i in range(N): A[i],M = mi() B = li() for pi in B: G.add_edge(pi-1,i,1,A[pi-1]-A[i]) for i in range(N-1): G.add_edge(i,i+1,K,0) f = G.flow(0,N-1,K,first=True) print(-f)