結果
問題 | No.1324 Approximate the Matrix |
ユーザー | ああいい |
提出日時 | 2022-04-14 11:17:16 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 801 ms / 2,000 ms |
コード長 | 2,578 bytes |
コンパイル時間 | 268 ms |
コンパイル使用メモリ | 86,804 KB |
実行使用メモリ | 90,652 KB |
最終ジャッジ日時 | 2023-08-25 20:01:35 |
合計ジャッジ時間 | 13,691 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
70,748 KB |
testcase_01 | AC | 74 ms
70,956 KB |
testcase_02 | AC | 73 ms
70,828 KB |
testcase_03 | AC | 500 ms
84,728 KB |
testcase_04 | AC | 501 ms
84,664 KB |
testcase_05 | AC | 550 ms
85,532 KB |
testcase_06 | AC | 513 ms
84,940 KB |
testcase_07 | AC | 510 ms
84,644 KB |
testcase_08 | AC | 174 ms
78,608 KB |
testcase_09 | AC | 189 ms
78,872 KB |
testcase_10 | AC | 208 ms
79,436 KB |
testcase_11 | AC | 250 ms
80,932 KB |
testcase_12 | AC | 197 ms
78,976 KB |
testcase_13 | AC | 163 ms
78,576 KB |
testcase_14 | AC | 256 ms
80,948 KB |
testcase_15 | AC | 194 ms
79,724 KB |
testcase_16 | AC | 149 ms
77,672 KB |
testcase_17 | AC | 269 ms
80,748 KB |
testcase_18 | AC | 183 ms
78,732 KB |
testcase_19 | AC | 194 ms
79,232 KB |
testcase_20 | AC | 148 ms
78,684 KB |
testcase_21 | AC | 165 ms
77,636 KB |
testcase_22 | AC | 91 ms
76,040 KB |
testcase_23 | AC | 246 ms
79,524 KB |
testcase_24 | AC | 300 ms
81,788 KB |
testcase_25 | AC | 267 ms
80,868 KB |
testcase_26 | AC | 248 ms
80,824 KB |
testcase_27 | AC | 213 ms
79,768 KB |
testcase_28 | AC | 73 ms
70,776 KB |
testcase_29 | AC | 83 ms
75,628 KB |
testcase_30 | AC | 83 ms
75,276 KB |
testcase_31 | AC | 92 ms
75,736 KB |
testcase_32 | AC | 73 ms
71,020 KB |
testcase_33 | AC | 74 ms
70,828 KB |
testcase_34 | AC | 74 ms
71,008 KB |
testcase_35 | AC | 76 ms
74,680 KB |
testcase_36 | AC | 72 ms
71,000 KB |
testcase_37 | AC | 801 ms
90,068 KB |
testcase_38 | AC | 744 ms
90,272 KB |
testcase_39 | AC | 768 ms
90,416 KB |
testcase_40 | AC | 794 ms
90,124 KB |
testcase_41 | AC | 795 ms
90,652 KB |
testcase_42 | AC | 90 ms
76,048 KB |
testcase_43 | AC | 93 ms
76,992 KB |
testcase_44 | AC | 93 ms
76,772 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 #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)