結果
問題 | No.1324 Approximate the Matrix |
ユーザー | chineristAC |
提出日時 | 2020-12-22 12:41:34 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,344 ms / 2,000 ms |
コード長 | 2,114 bytes |
コンパイル時間 | 383 ms |
コンパイル使用メモリ | 81,796 KB |
実行使用メモリ | 89,384 KB |
最終ジャッジ日時 | 2023-10-21 12:51:23 |
合計ジャッジ時間 | 15,783 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
53,460 KB |
testcase_01 | AC | 42 ms
53,460 KB |
testcase_02 | AC | 41 ms
53,460 KB |
testcase_03 | AC | 584 ms
83,412 KB |
testcase_04 | AC | 534 ms
83,376 KB |
testcase_05 | AC | 568 ms
83,448 KB |
testcase_06 | AC | 559 ms
83,404 KB |
testcase_07 | AC | 583 ms
83,436 KB |
testcase_08 | AC | 167 ms
77,504 KB |
testcase_09 | AC | 195 ms
77,940 KB |
testcase_10 | AC | 218 ms
78,636 KB |
testcase_11 | AC | 271 ms
79,596 KB |
testcase_12 | AC | 196 ms
78,108 KB |
testcase_13 | AC | 158 ms
77,508 KB |
testcase_14 | AC | 277 ms
80,092 KB |
testcase_15 | AC | 192 ms
78,428 KB |
testcase_16 | AC | 137 ms
76,812 KB |
testcase_17 | AC | 296 ms
78,904 KB |
testcase_18 | AC | 193 ms
78,572 KB |
testcase_19 | AC | 178 ms
77,684 KB |
testcase_20 | AC | 144 ms
77,392 KB |
testcase_21 | AC | 158 ms
77,032 KB |
testcase_22 | AC | 63 ms
70,492 KB |
testcase_23 | AC | 275 ms
79,092 KB |
testcase_24 | AC | 344 ms
80,832 KB |
testcase_25 | AC | 326 ms
80,244 KB |
testcase_26 | AC | 284 ms
79,696 KB |
testcase_27 | AC | 216 ms
78,436 KB |
testcase_28 | AC | 42 ms
53,460 KB |
testcase_29 | AC | 53 ms
61,940 KB |
testcase_30 | AC | 55 ms
63,756 KB |
testcase_31 | AC | 59 ms
66,192 KB |
testcase_32 | AC | 42 ms
53,460 KB |
testcase_33 | AC | 43 ms
53,460 KB |
testcase_34 | AC | 43 ms
53,460 KB |
testcase_35 | AC | 47 ms
59,064 KB |
testcase_36 | AC | 42 ms
53,460 KB |
testcase_37 | AC | 1,141 ms
89,124 KB |
testcase_38 | AC | 1,344 ms
89,384 KB |
testcase_39 | AC | 1,210 ms
89,136 KB |
testcase_40 | AC | 1,252 ms
88,728 KB |
testcase_41 | AC | 1,320 ms
89,048 KB |
testcase_42 | AC | 61 ms
70,436 KB |
testcase_43 | AC | 62 ms
70,436 KB |
testcase_44 | AC | 62 ms
70,436 KB |
ソースコード
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): 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: 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 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 i in range(N)] G = MinCostFlow(2*N+2) for i in range(1,N+1): G.add_edge(0,i,A[i-1],0) for j in range(N+1,2*N+1): for k in range(min(A[i-1],B[j-N-1])): G.add_edge(i,j,1,2*k+1-2*p[i-1][j-N-1]) for j in range(N+1,2*N+1): G.add_edge(j,2*N+1,B[j-N-1],0) f = G.flow(0,2*N+1,K) for i in range(N): for j in range(N): f += p[i][j]**2 print(f)