結果

問題 No.1324 Approximate the Matrix
ユーザー tamatotamato
提出日時 2021-02-22 17:25:10
言語 PyPy3
(7.3.15)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,930 bytes
コンパイル時間 964 ms
コンパイル使用メモリ 81,828 KB
実行使用メモリ 88,676 KB
最終ジャッジ日時 2023-10-21 12:30:53
合計ジャッジ時間 21,552 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
53,524 KB
testcase_01 AC 41 ms
53,524 KB
testcase_02 AC 42 ms
53,524 KB
testcase_03 AC 778 ms
82,796 KB
testcase_04 AC 663 ms
82,840 KB
testcase_05 AC 776 ms
83,068 KB
testcase_06 AC 773 ms
83,016 KB
testcase_07 AC 757 ms
83,472 KB
testcase_08 AC 153 ms
77,676 KB
testcase_09 AC 195 ms
78,324 KB
testcase_10 AC 232 ms
78,648 KB
testcase_11 AC 294 ms
79,632 KB
testcase_12 AC 194 ms
77,976 KB
testcase_13 AC 156 ms
77,824 KB
testcase_14 AC 298 ms
79,932 KB
testcase_15 AC 176 ms
77,764 KB
testcase_16 AC 133 ms
76,824 KB
testcase_17 AC 299 ms
79,624 KB
testcase_18 AC 181 ms
78,092 KB
testcase_19 AC 182 ms
77,780 KB
testcase_20 AC 146 ms
77,500 KB
testcase_21 AC 144 ms
77,100 KB
testcase_22 AC 58 ms
68,296 KB
testcase_23 AC 266 ms
78,968 KB
testcase_24 AC 384 ms
80,536 KB
testcase_25 AC 305 ms
79,580 KB
testcase_26 AC 307 ms
79,668 KB
testcase_27 AC 222 ms
78,624 KB
testcase_28 AC 40 ms
53,572 KB
testcase_29 AC 52 ms
64,076 KB
testcase_30 AC 53 ms
64,200 KB
testcase_31 AC 59 ms
66,380 KB
testcase_32 AC 41 ms
53,572 KB
testcase_33 AC 41 ms
53,572 KB
testcase_34 AC 42 ms
53,572 KB
testcase_35 AC 42 ms
53,572 KB
testcase_36 AC 41 ms
53,572 KB
testcase_37 TLE -
testcase_38 TLE -
testcase_39 AC 1,707 ms
88,260 KB
testcase_40 TLE -
testcase_41 TLE -
testcase_42 AC 56 ms
68,192 KB
testcase_43 AC 55 ms
68,192 KB
testcase_44 AC 55 ms
68,192 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.buffer.readline
    from heapq import heappush, heappop

    class Mincostflow():
        def __init__(self, N):
            self.N = N
            self.adj = [[] for _ in range(N + 1)]
            self.inf = 1 << 60

        def add_edge(self, fr, to, cap, cost):
            # [to, cap, cost, rev]
            if cap == 0:
                return
            forward = [to, cap, cost, None]
            backward = forward[3] = [fr, 0, -cost, forward]
            self.adj[fr].append(forward)
            self.adj[to].append(backward)

        def flow(self, s, t, f):
            N = self.N
            adj = self.adj
            inf = self.inf

            res = 0
            H = [0] * (N + 1)
            prev_v = [0] * (N + 1)
            prev_e = [None] * (N + 1)

            dist0 = [inf] * (N + 1)
            dist = [inf] * (N + 1)

            while f:
                dist[:] = dist0
                dist[s] = 0
                pq = [(0, s)]
                while pq:
                    d, v = heappop(pq)
                    if d > dist[v]:
                        continue
                    r0 = dist[v] + H[v]
                    for e in adj[v]:
                        u, cap, cost, _ = e
                        if cap > 0 and r0 + cost - H[u] < dist[u]:
                            dist[u] = r = r0 + cost - H[u]
                            heappush(pq, (r, u))
                            prev_v[u] = v
                            prev_e[u] = e

                # flow f doesn't exist
                if dist[t] == inf:
                    return None

                for i in range(1, N + 1):
                    H[i] += dist[i]

                g = f
                v = t
                while v != s:
                    g = min(g, prev_e[v][1])
                    v = prev_v[v]
                f -= g
                res += g * H[t]
                v = t
                while v != s:
                    e = prev_e[v]
                    e[1] -= g
                    e[-1][1] += g
                    v = prev_v[v]

            return res

    N, K = map(int, input().split())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))
    P = []
    for _ in range(N):
        P.append(list(map(int, input().split())))

    s = N*2 + 1
    t = s + 1
    mcf = Mincostflow(t)
    for i, a in enumerate(A):
        va = i+1
        mcf.add_edge(s, va, a, 0)
        for j, b in enumerate(B):
            vb = N+j+1
            p = P[i][j]
            for f in range(min(a, b)):
                mcf.add_edge(va, vb, 1, 500 - 2 * (p-f) + 1)
    for j, b in enumerate(B):
        vb = N+j+1
        mcf.add_edge(vb, t, b, 0)
    ans = mcf.flow(s, t, K) - 500 * K
    for i in range(N):
        for j in range(N):
            ans += P[i][j] ** 2
    print(ans)


if __name__ == '__main__':
    main()
0