結果

問題 No.1324 Approximate the Matrix
ユーザー chineristACchineristAC
提出日時 2022-03-16 18:28:04
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,101 ms / 2,000 ms
コード長 2,216 bytes
コンパイル時間 166 ms
コンパイル使用メモリ 81,752 KB
実行使用メモリ 89,416 KB
最終ジャッジ日時 2023-10-24 23:56:53
合計ジャッジ時間 15,405 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
53,512 KB
testcase_01 AC 38 ms
53,512 KB
testcase_02 AC 38 ms
53,512 KB
testcase_03 AC 536 ms
83,452 KB
testcase_04 AC 500 ms
83,412 KB
testcase_05 AC 539 ms
83,500 KB
testcase_06 AC 546 ms
83,444 KB
testcase_07 AC 558 ms
83,484 KB
testcase_08 AC 159 ms
77,544 KB
testcase_09 AC 183 ms
77,976 KB
testcase_10 AC 211 ms
78,684 KB
testcase_11 AC 257 ms
79,640 KB
testcase_12 AC 182 ms
78,144 KB
testcase_13 AC 150 ms
77,540 KB
testcase_14 AC 267 ms
80,124 KB
testcase_15 AC 188 ms
78,464 KB
testcase_16 AC 130 ms
76,884 KB
testcase_17 AC 265 ms
78,944 KB
testcase_18 AC 182 ms
78,608 KB
testcase_19 AC 170 ms
77,732 KB
testcase_20 AC 132 ms
77,412 KB
testcase_21 AC 147 ms
77,092 KB
testcase_22 AC 59 ms
70,536 KB
testcase_23 AC 254 ms
79,132 KB
testcase_24 AC 317 ms
80,872 KB
testcase_25 AC 309 ms
80,284 KB
testcase_26 AC 259 ms
79,748 KB
testcase_27 AC 199 ms
78,484 KB
testcase_28 AC 37 ms
53,512 KB
testcase_29 AC 50 ms
61,984 KB
testcase_30 AC 50 ms
63,808 KB
testcase_31 AC 55 ms
66,248 KB
testcase_32 AC 39 ms
53,512 KB
testcase_33 AC 40 ms
53,512 KB
testcase_34 AC 39 ms
53,512 KB
testcase_35 AC 42 ms
59,112 KB
testcase_36 AC 39 ms
53,512 KB
testcase_37 AC 930 ms
89,160 KB
testcase_38 AC 1,101 ms
89,416 KB
testcase_39 AC 945 ms
89,112 KB
testcase_40 AC 1,038 ms
88,760 KB
testcase_41 AC 1,025 ms
89,088 KB
testcase_42 AC 57 ms
70,480 KB
testcase_43 AC 58 ms
70,480 KB
testcase_44 AC 58 ms
70,480 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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
                else:
                    pass
                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))
                    else:
                        pass
            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)
0