結果

問題 No.1324 Approximate the Matrix
ユーザー theory_and_metheory_and_me
提出日時 2020-12-05 18:01:56
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,303 bytes
コンパイル時間 157 ms
コンパイル使用メモリ 81,872 KB
実行使用メモリ 89,696 KB
最終ジャッジ日時 2023-10-20 03:48:29
合計ジャッジ時間 24,864 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
53,524 KB
testcase_01 AC 44 ms
53,524 KB
testcase_02 AC 39 ms
53,524 KB
testcase_03 AC 1,432 ms
89,296 KB
testcase_04 AC 1,355 ms
89,404 KB
testcase_05 AC 1,519 ms
89,156 KB
testcase_06 AC 1,570 ms
89,412 KB
testcase_07 AC 1,510 ms
89,132 KB
testcase_08 AC 190 ms
79,312 KB
testcase_09 AC 201 ms
79,156 KB
testcase_10 AC 254 ms
80,344 KB
testcase_11 AC 417 ms
81,876 KB
testcase_12 AC 189 ms
78,468 KB
testcase_13 AC 163 ms
78,032 KB
testcase_14 AC 417 ms
82,304 KB
testcase_15 AC 232 ms
79,676 KB
testcase_16 AC 128 ms
76,984 KB
testcase_17 AC 327 ms
80,032 KB
testcase_18 AC 193 ms
78,692 KB
testcase_19 AC 180 ms
78,248 KB
testcase_20 AC 166 ms
78,056 KB
testcase_21 AC 153 ms
77,512 KB
testcase_22 AC 118 ms
77,744 KB
testcase_23 AC 248 ms
79,500 KB
testcase_24 AC 645 ms
82,880 KB
testcase_25 AC 362 ms
81,324 KB
testcase_26 AC 332 ms
80,472 KB
testcase_27 AC 230 ms
79,064 KB
testcase_28 AC 41 ms
53,524 KB
testcase_29 AC 52 ms
62,024 KB
testcase_30 AC 59 ms
66,436 KB
testcase_31 AC 58 ms
66,288 KB
testcase_32 AC 41 ms
53,524 KB
testcase_33 AC 41 ms
53,524 KB
testcase_34 AC 41 ms
53,524 KB
testcase_35 AC 46 ms
61,268 KB
testcase_36 AC 45 ms
59,148 KB
testcase_37 TLE -
testcase_38 TLE -
testcase_39 TLE -
testcase_40 AC 1,756 ms
89,388 KB
testcase_41 AC 1,698 ms
89,696 KB
testcase_42 AC 55 ms
70,672 KB
testcase_43 AC 54 ms
70,668 KB
testcase_44 AC 55 ms
70,608 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