結果
問題 | No.1324 Approximate the Matrix |
ユーザー | ああいい |
提出日時 | 2022-04-14 10:33:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,226 ms / 2,000 ms |
コード長 | 2,617 bytes |
コンパイル時間 | 261 ms |
コンパイル使用メモリ | 87,192 KB |
実行使用メモリ | 91,752 KB |
最終ジャッジ日時 | 2023-08-25 19:51:05 |
合計ジャッジ時間 | 16,173 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
71,248 KB |
testcase_01 | AC | 73 ms
70,956 KB |
testcase_02 | AC | 75 ms
71,100 KB |
testcase_03 | AC | 634 ms
85,756 KB |
testcase_04 | AC | 598 ms
85,424 KB |
testcase_05 | AC | 617 ms
85,152 KB |
testcase_06 | AC | 621 ms
85,428 KB |
testcase_07 | AC | 629 ms
85,672 KB |
testcase_08 | AC | 169 ms
79,084 KB |
testcase_09 | AC | 194 ms
79,604 KB |
testcase_10 | AC | 217 ms
80,012 KB |
testcase_11 | AC | 270 ms
81,380 KB |
testcase_12 | AC | 215 ms
80,320 KB |
testcase_13 | AC | 174 ms
79,088 KB |
testcase_14 | AC | 274 ms
81,760 KB |
testcase_15 | AC | 206 ms
80,056 KB |
testcase_16 | AC | 155 ms
78,336 KB |
testcase_17 | AC | 288 ms
81,592 KB |
testcase_18 | AC | 193 ms
79,552 KB |
testcase_19 | AC | 211 ms
79,732 KB |
testcase_20 | AC | 157 ms
78,760 KB |
testcase_21 | AC | 165 ms
78,568 KB |
testcase_22 | AC | 93 ms
76,512 KB |
testcase_23 | AC | 279 ms
81,056 KB |
testcase_24 | AC | 329 ms
81,804 KB |
testcase_25 | AC | 294 ms
81,784 KB |
testcase_26 | AC | 258 ms
80,456 KB |
testcase_27 | AC | 226 ms
80,632 KB |
testcase_28 | AC | 75 ms
71,308 KB |
testcase_29 | AC | 85 ms
75,888 KB |
testcase_30 | AC | 84 ms
75,664 KB |
testcase_31 | AC | 94 ms
76,096 KB |
testcase_32 | AC | 76 ms
71,360 KB |
testcase_33 | AC | 74 ms
71,348 KB |
testcase_34 | AC | 76 ms
71,368 KB |
testcase_35 | AC | 80 ms
75,276 KB |
testcase_36 | AC | 75 ms
71,332 KB |
testcase_37 | AC | 1,019 ms
90,756 KB |
testcase_38 | AC | 1,067 ms
91,752 KB |
testcase_39 | AC | 1,226 ms
91,204 KB |
testcase_40 | AC | 990 ms
90,728 KB |
testcase_41 | AC | 1,008 ms
91,128 KB |
testcase_42 | AC | 90 ms
76,296 KB |
testcase_43 | AC | 90 ms
76,528 KB |
testcase_44 | AC | 90 ms
76,384 KB |
ソースコード
#その2 最初はコストが全部正の場合に使えるダイクストラ from heapq import heappush,heappop class MinCostFlow: inf = 10 **10 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 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 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 import sys rr = sys.stdin N,K = map(int,rr.readline().split()) A = list(map(int,rr.readline().split())) B = list(map(int,rr.readline().split())) P = [list(map(int,rr.readline().split())) for _ in range(N)] mincost = MinCostFlow(N + N + 2) s = N + N t = N + N + 1 inf = 400 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,inf + (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) - inf * K print(ans)