結果

問題 No.957 植林
コンテスト
ユーザー tktk_snsn
提出日時 2021-01-07 23:30:46
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,868 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 304 ms
コンパイル使用メモリ 82,240 KB
実行使用メモリ 202,080 KB
最終ジャッジ日時 2024-11-14 05:22:56
合計ジャッジ時間 75,118 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 12 WA * 10 TLE * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

# https://tjkendev.github.io/procon-library/python/max_flow/push-relabel-fifo.html
from collections import deque
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
inf = 10**15


class PushRelabel:
    def __init__(self, N):
        self.N = N
        self.G = [[] for i in range(N)]
        self.initial = [N]*N
        self.zeros = [0]*(N+1)

    def add_edge(self, fr, to, cap):
        forward = [to, cap, None]
        forward[2] = backward = [fr, 0, forward]
        self.G[fr].append(forward)
        self.G[to].append(backward)

    def add_multi_edge(self, v1, v2, cap1, cap2):
        edge1 = [v2, cap1, None]
        edge1[2] = edge2 = [v1, cap2, edge1]
        self.G[v1].append(edge1)
        self.G[v2].append(edge2)

    # Global labeling
    def bfs(self, H, D, t, que=deque()):
        que.append(t)
        G = self.G
        H[:] = self.initial
        H[t] = 0
        D[:] = self.zeros
        D[0] = 1
        N = self.N
        c = N-1
        while que:
            v = que.popleft()
            d = H[v] + 1
            for w, cap, backward in G[v]:
                if H[w] <= d or backward[1] == 0:
                    continue
                H[w] = d
                D[d] += 1
                c -= 1
                que.append(w)
        D[N] = c
        return d  # gap

    # FIFO preflow-push algorithm
    def flow(self, s, t):
        N = self.N
        H = [0]*N  # height
        F = [0]*N  # excess flow
        D = [0]*(N+1)  # distance label
        active = [0]*N  # active node

        G = self.G

        que = deque([s])
        F[s] = 10**18
        active[s] = 1

        gap = self.bfs(H, D, t)

        cnt = 0
        while que:
            v = que.popleft()
            if v == t:
                continue

            hv = H[v]
            # Gap-relabeling
            if hv > gap:
                D[hv] -= 1
                D[N] += 1
                hv = H[v] = N
                continue
            # push
            rest = F[v]
            for e in G[v]:
                w, cap, backward = e
                if cap and hv > H[w] < gap:
                    d = min(rest, cap)
                    e[1] -= d
                    backward[1] += d
                    rest -= d
                    F[w] += d
                    if not active[w]:
                        que.append(w)
                        active[w] = 1
                    if rest == 0:
                        break
            F[v] = rest

            if rest == 0:
                active[v] = 0
                continue

            # relabel
            h0 = H[v]
            hv = N
            for w, cap, backward in G[v]:
                if cap and hv > H[w] + 1 <= gap:
                    hv = H[w] + 1
            if hv != h0:
                D[h0] -= 1
                if D[h0] == 0 and h0 < gap:
                    gap = h0
                    hv = N
                elif hv == gap:
                    gap += 1
                D[hv] += 1

            H[v] = hv
            if hv < N:
                que.append(v)
            else:
                active[v] = 0

            cnt += 1
            if cnt % N == 0:
                gap = self.bfs(H, D, t)
        return F[t]


H, W = map(int, input().split())
A = tuple(tuple(map(int, input().split())) for _ in range(H))
R = tuple(map(int, input().split()))
C = tuple(map(int, input().split()))

g = PushRelabel(H + W + 2)
source = H + W
sink = source + 1

ans = 0
for i in range(H):
    for j in range(W):
        g.add_edge(i, H + j, A[i][j])
for i in range(H):
    sumA = sum(A[i])
    if R[i] >= sumA:  # 木を植えちゃう
        ans += R[i] - sumA
        g.add_edge(source, i, R[i] - sumA)
    else:
        g.add_edge(source, i, sumA - R[i])
for j in range(W):
    ans += C[j]
    g.add_edge(H + j, sink, C[j])

ans -= g.flow(source, sink)
print(ans)
0