結果

問題 No.1324 Approximate the Matrix
コンテスト
ユーザー theory_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
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 32 TLE * 10
権限があれば一括ダウンロードができます

ソースコード

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