結果
問題 | No.1324 Approximate the Matrix |
ユーザー | ああいい |
提出日時 | 2022-04-14 11:05:20 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,808 bytes |
コンパイル時間 | 755 ms |
コンパイル使用メモリ | 86,408 KB |
実行使用メモリ | 90,880 KB |
最終ジャッジ日時 | 2023-08-25 19:58:40 |
合計ジャッジ時間 | 16,987 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
70,856 KB |
testcase_01 | AC | 75 ms
70,992 KB |
testcase_02 | AC | 75 ms
70,888 KB |
testcase_03 | AC | 568 ms
85,096 KB |
testcase_04 | AC | 556 ms
84,632 KB |
testcase_05 | AC | 596 ms
84,696 KB |
testcase_06 | AC | 582 ms
85,012 KB |
testcase_07 | AC | 640 ms
84,616 KB |
testcase_08 | AC | 157 ms
78,240 KB |
testcase_09 | AC | 168 ms
78,492 KB |
testcase_10 | AC | 190 ms
79,380 KB |
testcase_11 | AC | 241 ms
80,832 KB |
testcase_12 | AC | 175 ms
78,980 KB |
testcase_13 | AC | 155 ms
78,676 KB |
testcase_14 | AC | 233 ms
80,180 KB |
testcase_15 | AC | 179 ms
78,576 KB |
testcase_16 | WA | - |
testcase_17 | AC | 239 ms
80,760 KB |
testcase_18 | AC | 167 ms
78,308 KB |
testcase_19 | WA | - |
testcase_20 | AC | 147 ms
78,788 KB |
testcase_21 | AC | 154 ms
77,784 KB |
testcase_22 | AC | 92 ms
75,868 KB |
testcase_23 | AC | 238 ms
79,380 KB |
testcase_24 | AC | 306 ms
80,796 KB |
testcase_25 | AC | 257 ms
80,744 KB |
testcase_26 | AC | 230 ms
80,172 KB |
testcase_27 | AC | 205 ms
78,992 KB |
testcase_28 | AC | 76 ms
70,992 KB |
testcase_29 | AC | 89 ms
75,156 KB |
testcase_30 | AC | 85 ms
75,052 KB |
testcase_31 | AC | 95 ms
75,648 KB |
testcase_32 | AC | 75 ms
70,700 KB |
testcase_33 | AC | 75 ms
70,852 KB |
testcase_34 | AC | 75 ms
71,216 KB |
testcase_35 | AC | 78 ms
70,760 KB |
testcase_36 | AC | 75 ms
71,084 KB |
testcase_37 | AC | 1,059 ms
90,676 KB |
testcase_38 | AC | 1,125 ms
90,676 KB |
testcase_39 | TLE | - |
testcase_40 | AC | 1,193 ms
90,108 KB |
testcase_41 | AC | 1,158 ms
90,880 KB |
testcase_42 | AC | 94 ms
75,796 KB |
testcase_43 | AC | 91 ms
75,800 KB |
testcase_44 | AC | 88 ms
75,856 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 vis = [False] * N q = [(0,s)] while q: c,v = heappop(q) if vis[v]:continue vis[v] = True if v == t:break #r0 = dist[v] + H[v] for e in G[v]: w,cap,cost,_ = e cost = cost - H[w] + H[v] if cap > 0 and dist[v] + cost < dist[w]: dist[w] = dist[v] + cost prev_v[w] = v prev_e[w] = e heappush(q,(dist[w],w)) if dist[t] == inf: return None """ for i in range(N): H[i] += dist[i] """ for i in range(N): if vis[v]: H[i] += dist[i] - dist[t] d = f v = t while v != s: d = min(d,prev_e[v][1]) v = prev_v[v] f -= d res += d * -H[s] 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)