結果

問題 No.1324 Approximate the Matrix
ユーザー chineristACchineristAC
提出日時 2020-12-22 12:36:44
言語 PyPy3
(7.3.13)
結果
AC  
実行時間 1,091 ms / 2,000 ms
コード長 2,100 bytes
コンパイル時間 4,789 ms
コンパイル使用メモリ 81,640 KB
実行使用メモリ 89,832 KB
最終ジャッジ日時 2023-10-21 12:50:41
合計ジャッジ時間 16,054 ms
ジャッジサーバーID
(参考情報)
judge11 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
53,520 KB
testcase_01 AC 38 ms
53,520 KB
testcase_02 AC 39 ms
53,520 KB
testcase_03 AC 854 ms
89,340 KB
testcase_04 AC 856 ms
89,336 KB
testcase_05 AC 876 ms
89,068 KB
testcase_06 AC 857 ms
89,280 KB
testcase_07 AC 824 ms
89,192 KB
testcase_08 AC 195 ms
79,444 KB
testcase_09 AC 194 ms
79,032 KB
testcase_10 AC 246 ms
80,808 KB
testcase_11 AC 362 ms
82,160 KB
testcase_12 AC 169 ms
78,416 KB
testcase_13 AC 160 ms
78,144 KB
testcase_14 AC 332 ms
82,252 KB
testcase_15 AC 209 ms
79,820 KB
testcase_16 AC 118 ms
76,944 KB
testcase_17 AC 288 ms
80,572 KB
testcase_18 AC 178 ms
78,592 KB
testcase_19 AC 166 ms
78,048 KB
testcase_20 AC 149 ms
77,932 KB
testcase_21 AC 139 ms
77,364 KB
testcase_22 AC 112 ms
77,512 KB
testcase_23 AC 232 ms
79,436 KB
testcase_24 AC 468 ms
83,200 KB
testcase_25 AC 318 ms
81,260 KB
testcase_26 AC 320 ms
80,864 KB
testcase_27 AC 209 ms
78,964 KB
testcase_28 AC 36 ms
53,520 KB
testcase_29 AC 47 ms
61,980 KB
testcase_30 AC 54 ms
66,272 KB
testcase_31 AC 55 ms
66,244 KB
testcase_32 AC 37 ms
53,520 KB
testcase_33 AC 38 ms
53,520 KB
testcase_34 AC 38 ms
53,520 KB
testcase_35 AC 44 ms
61,224 KB
testcase_36 AC 44 ms
61,948 KB
testcase_37 AC 1,000 ms
89,832 KB
testcase_38 AC 937 ms
89,824 KB
testcase_39 AC 987 ms
89,320 KB
testcase_40 AC 858 ms
89,732 KB
testcase_41 AC 1,091 ms
89,356 KB
testcase_42 AC 56 ms
72,668 KB
testcase_43 AC 57 ms
70,612 KB
testcase_44 AC 57 ms
72,600 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
                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

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(A[i-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