結果

問題 No.1324 Approximate the Matrix
ユーザー theory_and_metheory_and_me
提出日時 2020-12-05 18:28:23
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,368 ms / 2,000 ms
コード長 2,415 bytes
コンパイル時間 210 ms
コンパイル使用メモリ 82,512 KB
実行使用メモリ 90,288 KB
最終ジャッジ日時 2024-09-19 23:35:52
合計ジャッジ時間 18,953 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
53,688 KB
testcase_01 AC 35 ms
53,644 KB
testcase_02 AC 37 ms
53,264 KB
testcase_03 AC 1,216 ms
89,480 KB
testcase_04 AC 1,075 ms
89,592 KB
testcase_05 AC 1,199 ms
89,556 KB
testcase_06 AC 1,210 ms
89,648 KB
testcase_07 AC 1,196 ms
89,368 KB
testcase_08 AC 172 ms
79,508 KB
testcase_09 AC 190 ms
79,524 KB
testcase_10 AC 237 ms
80,748 KB
testcase_11 AC 395 ms
82,460 KB
testcase_12 AC 171 ms
79,136 KB
testcase_13 AC 146 ms
78,536 KB
testcase_14 AC 370 ms
82,628 KB
testcase_15 AC 206 ms
79,908 KB
testcase_16 AC 119 ms
77,072 KB
testcase_17 AC 291 ms
80,380 KB
testcase_18 AC 178 ms
79,088 KB
testcase_19 AC 167 ms
78,572 KB
testcase_20 AC 143 ms
78,352 KB
testcase_21 AC 139 ms
77,636 KB
testcase_22 AC 108 ms
78,064 KB
testcase_23 AC 225 ms
79,752 KB
testcase_24 AC 530 ms
83,424 KB
testcase_25 AC 340 ms
81,900 KB
testcase_26 AC 292 ms
80,844 KB
testcase_27 AC 204 ms
79,432 KB
testcase_28 AC 35 ms
53,328 KB
testcase_29 AC 46 ms
62,372 KB
testcase_30 AC 55 ms
66,024 KB
testcase_31 AC 53 ms
64,712 KB
testcase_32 AC 37 ms
53,292 KB
testcase_33 AC 37 ms
54,468 KB
testcase_34 AC 37 ms
54,500 KB
testcase_35 AC 41 ms
61,556 KB
testcase_36 AC 42 ms
59,616 KB
testcase_37 AC 1,328 ms
89,720 KB
testcase_38 AC 1,368 ms
89,776 KB
testcase_39 AC 1,269 ms
89,428 KB
testcase_40 AC 1,277 ms
89,756 KB
testcase_41 AC 1,220 ms
90,288 KB
testcase_42 AC 55 ms
70,440 KB
testcase_43 AC 54 ms
70,688 KB
testcase_44 AC 54 ms
71,228 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#!/usr/local/bin/pypy
# python 想定解 O(NK)本の辺を張り，下駄をはかせる
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
                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))
            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

import sys
readline = sys.stdin.readline
write = sys.stdout.write

if __name__ == '__main__':
    BIG = 1000
    N, K = map(int, readline().split())
    A = list(map(int, readline().split()))
    B = list(map(int, readline().split()))
    P = []
    for i in range(N):
        P.append(list(map(int, readline().split())))

    mcf = MinCostFlow(2*N+2)
    s = 2*N
    t = s+1

    for i in range(N):
        mcf.add_edge(s, i, A[i], 0)

    S = 0

    for i in range(N):
        for j in range(N):
            S += P[i][j] * P[i][j]
            for x in range(A[i]):
                mcf.add_edge(i, N+j, 1, 2*(x-P[i][j])+1+BIG)

    for i in range(N):
        mcf.add_edge(N+i, t, B[i], 0)

    print(mcf.flow(s, t, K) + S - K*BIG)
0