結果

問題 No.1324 Approximate the Matrix
ユーザー theory_and_metheory_and_me
提出日時 2020-11-29 03:14:30
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,961 bytes
コンパイル時間 202 ms
コンパイル使用メモリ 81,940 KB
実行使用メモリ 90,464 KB
最終ジャッジ日時 2024-09-19 23:32:27
合計ジャッジ時間 32,037 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
52,884 KB
testcase_01 AC 37 ms
53,932 KB
testcase_02 AC 35 ms
53,660 KB
testcase_03 TLE -
testcase_04 TLE -
testcase_05 TLE -
testcase_06 TLE -
testcase_07 TLE -
testcase_08 AC 293 ms
80,056 KB
testcase_09 AC 222 ms
79,240 KB
testcase_10 AC 380 ms
81,560 KB
testcase_11 AC 722 ms
82,440 KB
testcase_12 AC 205 ms
78,880 KB
testcase_13 AC 170 ms
78,244 KB
testcase_14 AC 791 ms
83,356 KB
testcase_15 AC 415 ms
80,804 KB
testcase_16 AC 125 ms
76,972 KB
testcase_17 AC 404 ms
80,964 KB
testcase_18 AC 210 ms
79,196 KB
testcase_19 AC 171 ms
78,220 KB
testcase_20 AC 171 ms
78,296 KB
testcase_21 AC 150 ms
77,972 KB
testcase_22 AC 129 ms
78,036 KB
testcase_23 AC 273 ms
80,180 KB
testcase_24 AC 1,019 ms
83,680 KB
testcase_25 AC 436 ms
81,628 KB
testcase_26 AC 455 ms
81,288 KB
testcase_27 AC 233 ms
79,244 KB
testcase_28 AC 37 ms
53,224 KB
testcase_29 AC 46 ms
64,016 KB
testcase_30 AC 55 ms
66,772 KB
testcase_31 AC 58 ms
67,472 KB
testcase_32 AC 45 ms
60,860 KB
testcase_33 AC 38 ms
54,992 KB
testcase_34 AC 42 ms
60,924 KB
testcase_35 AC 49 ms
61,884 KB
testcase_36 AC 46 ms
62,100 KB
testcase_37 TLE -
testcase_38 TLE -
testcase_39 TLE -
testcase_40 TLE -
testcase_41 TLE -
testcase_42 AC 73 ms
76,940 KB
testcase_43 AC 70 ms
76,968 KB
testcase_44 AC 80 ms
76,752 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#!/usr/local/bin/pypy
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

        potential_flag = 0

        while f:
            if potential_flag:
                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))
            else:
                dist[:] = d0
                dist[s] = 0
                update = 1
                for _ in range(self.N):
                    for v in range(self.N):
                        for e in G[v]:
                            w, cap, cost, _ = e
                            if dist[v] != INF and cap > 0 and dist[v] + cost < dist[w]:
                                dist[w] = dist[v] + cost
                                prv_v[w] = v; prv_e[w] = e
                                update = 1
                    if not update:
                        break
                potential_flag = 1
            
            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
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 k in range(A[i]):
            mcf.add_edge(i, N+j, 1, 2*k+1-2*P[i][j])

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

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