結果

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

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
53,628 KB
testcase_01 AC 40 ms
54,156 KB
testcase_02 AC 37 ms
54,356 KB
testcase_03 AC 1,208 ms
89,624 KB
testcase_04 AC 1,119 ms
89,600 KB
testcase_05 AC 1,238 ms
89,436 KB
testcase_06 AC 1,247 ms
89,520 KB
testcase_07 AC 1,191 ms
89,368 KB
testcase_08 AC 178 ms
79,620 KB
testcase_09 AC 190 ms
79,520 KB
testcase_10 AC 239 ms
80,728 KB
testcase_11 AC 397 ms
82,196 KB
testcase_12 AC 179 ms
79,000 KB
testcase_13 AC 154 ms
78,744 KB
testcase_14 AC 381 ms
82,884 KB
testcase_15 AC 211 ms
79,904 KB
testcase_16 AC 116 ms
77,228 KB
testcase_17 AC 280 ms
80,660 KB
testcase_18 AC 171 ms
78,836 KB
testcase_19 AC 162 ms
78,572 KB
testcase_20 AC 142 ms
78,696 KB
testcase_21 AC 137 ms
77,916 KB
testcase_22 AC 106 ms
78,072 KB
testcase_23 AC 223 ms
79,880 KB
testcase_24 AC 534 ms
83,292 KB
testcase_25 AC 318 ms
81,516 KB
testcase_26 AC 294 ms
81,104 KB
testcase_27 AC 210 ms
79,424 KB
testcase_28 AC 38 ms
53,888 KB
testcase_29 AC 45 ms
62,804 KB
testcase_30 AC 54 ms
65,892 KB
testcase_31 AC 53 ms
65,208 KB
testcase_32 AC 38 ms
53,480 KB
testcase_33 AC 35 ms
53,540 KB
testcase_34 AC 40 ms
53,924 KB
testcase_35 AC 43 ms
59,572 KB
testcase_36 AC 41 ms
59,976 KB
testcase_37 AC 1,267 ms
89,980 KB
testcase_38 AC 1,327 ms
89,576 KB
testcase_39 AC 1,246 ms
89,808 KB
testcase_40 AC 1,291 ms
89,640 KB
testcase_41 AC 1,177 ms
89,904 KB
testcase_42 AC 55 ms
71,336 KB
testcase_43 AC 56 ms
70,400 KB
testcase_44 AC 53 ms
70,292 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
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