結果
問題 | No.1324 Approximate the Matrix |
ユーザー | 👑 tamato |
提出日時 | 2020-12-21 10:47:57 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,942 bytes |
コンパイル時間 | 157 ms |
コンパイル使用メモリ | 82,004 KB |
実行使用メモリ | 88,492 KB |
最終ジャッジ日時 | 2023-10-21 11:31:53 |
合計ジャッジ時間 | 23,043 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge9 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
53,752 KB |
testcase_01 | AC | 47 ms
53,752 KB |
testcase_02 | AC | 44 ms
53,752 KB |
testcase_03 | AC | 846 ms
83,216 KB |
testcase_04 | AC | 688 ms
82,992 KB |
testcase_05 | AC | 889 ms
83,084 KB |
testcase_06 | AC | 831 ms
83,088 KB |
testcase_07 | AC | 813 ms
83,172 KB |
testcase_08 | AC | 157 ms
78,032 KB |
testcase_09 | AC | 205 ms
78,412 KB |
testcase_10 | AC | 239 ms
78,936 KB |
testcase_11 | AC | 304 ms
79,592 KB |
testcase_12 | AC | 206 ms
78,308 KB |
testcase_13 | AC | 165 ms
77,968 KB |
testcase_14 | AC | 308 ms
79,924 KB |
testcase_15 | AC | 188 ms
77,940 KB |
testcase_16 | AC | 142 ms
76,972 KB |
testcase_17 | AC | 323 ms
79,392 KB |
testcase_18 | AC | 188 ms
78,208 KB |
testcase_19 | AC | 190 ms
78,060 KB |
testcase_20 | AC | 149 ms
77,776 KB |
testcase_21 | AC | 151 ms
77,240 KB |
testcase_22 | AC | 59 ms
68,508 KB |
testcase_23 | AC | 273 ms
79,096 KB |
testcase_24 | AC | 395 ms
80,552 KB |
testcase_25 | AC | 315 ms
79,904 KB |
testcase_26 | AC | 326 ms
79,852 KB |
testcase_27 | AC | 232 ms
78,696 KB |
testcase_28 | AC | 43 ms
53,752 KB |
testcase_29 | AC | 55 ms
64,276 KB |
testcase_30 | AC | 55 ms
64,392 KB |
testcase_31 | AC | 62 ms
66,524 KB |
testcase_32 | AC | 43 ms
53,752 KB |
testcase_33 | AC | 43 ms
53,752 KB |
testcase_34 | AC | 44 ms
53,752 KB |
testcase_35 | AC | 44 ms
53,752 KB |
testcase_36 | AC | 43 ms
53,752 KB |
testcase_37 | TLE | - |
testcase_38 | TLE | - |
testcase_39 | TLE | - |
testcase_40 | TLE | - |
testcase_41 | TLE | - |
testcase_42 | AC | 57 ms
68,404 KB |
testcase_43 | AC | 58 ms
68,404 KB |
testcase_44 | AC | 56 ms
68,404 KB |
ソースコード
mod = 1000000007 eps = 10**-9 def main(): import sys input = sys.stdin.buffer.readline from heapq import heappush, heappop class Mincostflow(): def __init__(self, N): self.N = N self.adj = [[] for _ in range(N + 1)] self.inf = 1 << 60 def add_edge(self, fr, to, cap, cost): # [to, cap, cost, rev] if cap == 0: return forward = [to, cap, cost, None] backward = forward[3] = [fr, 0, -cost, forward] self.adj[fr].append(forward) self.adj[to].append(backward) def flow(self, s, t, f): N = self.N adj = self.adj inf = self.inf res = 0 H = [0] * (N + 1) prev_v = [0] * (N + 1) prev_e = [None] * (N + 1) dist0 = [inf] * (N + 1) dist = [inf] * (N + 1) while f: dist[:] = dist0 dist[s] = 0 pq = [(0, s)] while pq: d, v = heappop(pq) if d > dist[v]: continue r0 = dist[v] + H[v] for e in adj[v]: u, cap, cost, _ = e if cap > 0 and r0 + cost - H[u] < dist[u]: dist[u] = r = r0 + cost - H[u] heappush(pq, (r, u)) prev_v[u] = v prev_e[u] = e # flow f doesn't exist if dist[t] == inf: return None for i in range(1, N + 1): H[i] += dist[i] g = f v = t while v != s: g = min(g, prev_e[v][1]) v = prev_v[v] f -= g res += g * H[t] v = t while v != s: e = prev_e[v] e[1] -= g e[-1][1] += g 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 = [] for _ in range(N): P.append(list(map(int, input().split()))) s = N*2 + 1 t = s + 1 mcf = Mincostflow(t) for i, a in enumerate(A): va = i+1 mcf.add_edge(s, va, a, 0) for j, b in enumerate(B): vb = N+j+1 p = P[i][j] for f in range(min(a, b)): mcf.add_edge(va, vb, 1, 40000 - (p-f)**2 + (p-f-1)**2) for j, b in enumerate(B): vb = N+j+1 mcf.add_edge(vb, t, b, 0) ans = mcf.flow(s, t, K) - 40000 * K for i in range(N): for j in range(N): ans += P[i][j] ** 2 print(ans) if __name__ == '__main__': main()