結果
問題 | No.1324 Approximate the Matrix |
ユーザー | ああいい |
提出日時 | 2022-04-14 11:15:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 935 ms / 2,000 ms |
コード長 | 2,578 bytes |
コンパイル時間 | 416 ms |
コンパイル使用メモリ | 87,172 KB |
実行使用メモリ | 91,416 KB |
最終ジャッジ日時 | 2023-08-25 20:00:50 |
合計ジャッジ時間 | 15,132 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
71,336 KB |
testcase_01 | AC | 75 ms
71,440 KB |
testcase_02 | AC | 75 ms
71,424 KB |
testcase_03 | AC | 558 ms
85,732 KB |
testcase_04 | AC | 578 ms
85,968 KB |
testcase_05 | AC | 591 ms
86,428 KB |
testcase_06 | AC | 563 ms
86,236 KB |
testcase_07 | AC | 543 ms
85,732 KB |
testcase_08 | AC | 188 ms
79,952 KB |
testcase_09 | AC | 206 ms
80,180 KB |
testcase_10 | AC | 234 ms
80,940 KB |
testcase_11 | AC | 286 ms
81,656 KB |
testcase_12 | AC | 214 ms
80,184 KB |
testcase_13 | AC | 183 ms
79,092 KB |
testcase_14 | AC | 289 ms
81,792 KB |
testcase_15 | AC | 216 ms
80,648 KB |
testcase_16 | AC | 161 ms
78,080 KB |
testcase_17 | AC | 297 ms
81,756 KB |
testcase_18 | AC | 211 ms
80,024 KB |
testcase_19 | AC | 200 ms
79,804 KB |
testcase_20 | AC | 165 ms
79,376 KB |
testcase_21 | AC | 179 ms
78,536 KB |
testcase_22 | AC | 94 ms
76,752 KB |
testcase_23 | AC | 281 ms
80,808 KB |
testcase_24 | AC | 339 ms
82,384 KB |
testcase_25 | AC | 301 ms
81,776 KB |
testcase_26 | AC | 277 ms
81,260 KB |
testcase_27 | AC | 225 ms
80,664 KB |
testcase_28 | AC | 73 ms
71,368 KB |
testcase_29 | AC | 83 ms
76,216 KB |
testcase_30 | AC | 83 ms
75,608 KB |
testcase_31 | AC | 93 ms
76,380 KB |
testcase_32 | AC | 75 ms
71,408 KB |
testcase_33 | AC | 78 ms
71,296 KB |
testcase_34 | AC | 78 ms
71,392 KB |
testcase_35 | AC | 79 ms
75,536 KB |
testcase_36 | AC | 77 ms
71,388 KB |
testcase_37 | AC | 935 ms
90,912 KB |
testcase_38 | AC | 836 ms
90,976 KB |
testcase_39 | AC | 845 ms
90,916 KB |
testcase_40 | AC | 919 ms
91,044 KB |
testcase_41 | AC | 880 ms
91,416 KB |
testcase_42 | AC | 91 ms
76,712 KB |
testcase_43 | AC | 91 ms
77,504 KB |
testcase_44 | AC | 92 ms
77,456 KB |
ソースコード
#その2 最初はコストが全部正の場合に使えるダイクストラ from heapq import heappush,heappop class MinCostFlow: inf = 10 ** 18 def __init__(self,N): self.N = N self.G = [[] for _ in range(N)] self.H = [0] * N self.edge = [] def add_edge(self,fr,to,cap,cost): e = [to,cap,cost,None] r = e[3] = [fr,0,-cost,e] self.G[fr].append(e) self.G[to].append(r) self.edge.append(e) def get_edge(self,i): return self.edge[i] def flow(self,s,t,f): N = self.N G = self.G inf = MinCostFlow.inf res = 0 H = self.H #ポテンシャル、コストが最初は正なので、最初は0でいい prev_v = [0] * N prev_e = [None] * N d0 = [inf] * N dist = [inf] * N while f: dist[:] = d0 dist[s] = 0 q = [(0,s)] while q: c,v = heappop(q) if dist[v] < c:continue #if v == t:break 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] prev_v[w] = v prev_e[w] = e heappush(q,(r,w)) if dist[t] == inf: return None for i in range(N): H[i] += dist[i] #H = [h + d if d < inf else h for h,d in zip(H,dist)] d = f v = t while v != s: d = min(d,prev_e[v][1]) v = prev_v[v] f -= d res += d * H[t] v = t while v != s: e = prev_e[v] e[1] -= d e[3][1] += d v = prev_v[v] return res N,K = map(int,input().split()) A = list(map(int,input().split())) B = list(map(int,input().split())) P = [list(map(int,input().split())) for _ in range(N)] mincost = MinCostFlow(N + N + 2) s = N + N t = N + N + 1 for i in range(N): for j in range(N): v = N + j for k in range(1,min(A[i],B[j])+1): mincost.add_edge(i,v,1,2 * (k - 1) + 1 - 2 * P[i][j]) for i in range(N): mincost.add_edge(s,i,A[i],0) for j in range(N): mincost.add_edge(j + N,t,B[j],0) ans = 0 for i in range(N): for j in range(N): ans += P[i][j] ** 2 ans += mincost.flow(s,t,K) print(ans)