結果

問題 No.1324 Approximate the Matrix
ユーザー theory_and_metheory_and_me
提出日時 2020-12-10 21:31:42
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 587 ms / 2,000 ms
コード長 4,724 bytes
コンパイル時間 154 ms
コンパイル使用メモリ 82,260 KB
実行使用メモリ 90,144 KB
最終ジャッジ日時 2024-09-19 23:39:32
合計ジャッジ時間 10,480 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
54,888 KB
testcase_01 AC 38 ms
54,428 KB
testcase_02 AC 38 ms
54,672 KB
testcase_03 AC 463 ms
89,644 KB
testcase_04 AC 484 ms
89,784 KB
testcase_05 AC 474 ms
89,888 KB
testcase_06 AC 480 ms
89,732 KB
testcase_07 AC 466 ms
89,916 KB
testcase_08 AC 159 ms
80,048 KB
testcase_09 AC 164 ms
79,764 KB
testcase_10 AC 183 ms
80,464 KB
testcase_11 AC 232 ms
82,568 KB
testcase_12 AC 152 ms
78,624 KB
testcase_13 AC 143 ms
78,496 KB
testcase_14 AC 233 ms
83,780 KB
testcase_15 AC 178 ms
80,824 KB
testcase_16 AC 111 ms
77,544 KB
testcase_17 AC 204 ms
80,760 KB
testcase_18 AC 151 ms
79,316 KB
testcase_19 AC 167 ms
78,892 KB
testcase_20 AC 138 ms
78,304 KB
testcase_21 AC 130 ms
78,304 KB
testcase_22 AC 112 ms
78,648 KB
testcase_23 AC 197 ms
80,056 KB
testcase_24 AC 280 ms
83,564 KB
testcase_25 AC 227 ms
81,504 KB
testcase_26 AC 206 ms
81,036 KB
testcase_27 AC 175 ms
79,272 KB
testcase_28 AC 38 ms
54,796 KB
testcase_29 AC 49 ms
64,108 KB
testcase_30 AC 59 ms
67,928 KB
testcase_31 AC 61 ms
69,296 KB
testcase_32 AC 39 ms
54,436 KB
testcase_33 AC 39 ms
54,068 KB
testcase_34 AC 39 ms
56,056 KB
testcase_35 AC 46 ms
63,120 KB
testcase_36 AC 37 ms
55,064 KB
testcase_37 AC 489 ms
90,144 KB
testcase_38 AC 472 ms
90,048 KB
testcase_39 AC 574 ms
89,528 KB
testcase_40 AC 461 ms
89,840 KB
testcase_41 AC 587 ms
89,680 KB
testcase_42 AC 58 ms
72,548 KB
testcase_43 AC 55 ms
70,768 KB
testcase_44 AC 54 ms
72,268 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#!/usr/local/bin/pypy
# python 想定解 O(NK)本の辺を張り，下駄をはかせる
# zkou さん (@meander_uts1) のライブラリを使用（https://atcoder.jp/contests/practice2/submissions/18032049Ω）
import heapq

class mcf_graph:
 
 
    def __init__(self, n):
        self.n = n
        self.pos = []
        self.g = [[] for _ in range(n)]
 
 
    def add_edge(self, from_, to, cap, cost):
        # assert 0 <= from_ < self.n
        # assert 0 <= to < self.n
        m = len(self.pos)
        self.pos.append((from_, len(self.g[from_])))
        self.g[from_].append(self.__class__._edge(to, len(self.g[to]), cap, cost))
        self.g[to].append(self.__class__._edge(from_, len(self.g[from_]) - 1, 0, -cost))
        return m
 
 
    class edge:
        def __init__(self, from_, to, cap, flow, cost):
            self.from_ = from_
            self.to = to
            self.cap = cap
            self.flow = flow
            self.cost = cost
 
 
    def get_edge(self, i):
        _e = self.g[self.pos[i][0]][self.pos[i][1]]
        _re = self.g[_e.to][_e.rev]
        return self.__class__.edge(self.pos[i][0], _e.to, _e.cap + _re.cap, _re.cap, _e.cost)
 
 
    def edges(self):
        ret = []
        for i in range(len(self.pos)):
            _e = self.g[self.pos[i][0]][self.pos[i][1]]
            _re = self.g[_e.to][_e.rev]
            ret.append(self.__class__.edge(self.pos[i][0], _e.to, _e.cap + _re.cap, _re.cap, _e.cost))
        return ret
 
 
    def _dual_ref(self, s, t):
        self.dist = [float('inf')] * self.n
        self.pv = [-1] * self.n
        self.pe = [-1] * self.n
        self.vis = [False] * self.n
 
        que = [(0, s)]
        self.dist[s] = 0
        while que:
            _, v = heapq.heappop(que)
            if self.vis[v]:
                continue
            self.vis[v] = True
            if v == t:
                break
            for i in range(len(self.g[v])):
                e = self.g[v][i]
                if self.vis[e.to] or e.cap == 0:
                    continue
                cost = e.cost - self.dual[e.to] + self.dual[v]
                if self.dist[e.to] > self.dist[v] + cost:
                    self.dist[e.to] = self.dist[v] + cost
                    self.pv[e.to] = v
                    self.pe[e.to] = i
                    heapq.heappush(que, (self.dist[e.to], e.to))
        if not self.vis[t]:
            return False
 
        for v in range(self.n):
            if not self.vis[v]:
                continue
            self.dual[v] -= self.dist[t] - self.dist[v]
        
        return True
 
 
    def slope(self, s, t, flow_limit=float('inf')):
        # assert 0 <= s < self.n
        # assert 0 <= t < self.n
        # assert s != t
        
        self.dual = [0] * self.n
        self.dist = [float('inf')] * self.n
        self.pv = [-1] * self.n
        self.pe = [-1] * self.n
        self.vis = [False] * self.n
 
        flow = 0
        cost = 0
        prev_cost = -1
        result = [(flow, cost)]
        while flow < flow_limit:
            if not self._dual_ref(s, t):
                break
            c = flow_limit - flow
            v = t
            while v != s:
                c = min(c, self.g[self.pv[v]][self.pe[v]].cap)
                v = self.pv[v]
            v = t
            while v != s:
                e = self.g[self.pv[v]][self.pe[v]]
                e.cap -= c
                self.g[v][e.rev].cap += c
                v = self.pv[v]
            d = -self.dual[s]
            flow += c
            cost += c * d
            if prev_cost == d:
                result.pop()
            result.append((flow, cost))
            prev_cost = cost
        return result
 
 
    def flow(self, s, t, flow_limit=float('inf')):
        return self.slope(s, t, flow_limit)[-1]
 
    
    class _edge:
        def __init__(self, to, rev, cap, cost):
            self.to = to
            self.rev = rev
            self.cap = cap
            self.cost = cost

import sys
readline = sys.stdin.readline
write = sys.stdout.write

if __name__ == '__main__':
    BIG = 400
    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 = mcf_graph(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)[1] + S - K*BIG)
0