結果

問題 No.2328 Build Walls
コンテスト
ユーザー gew1fw
提出日時 2025-06-12 20:53:19
言語 PyPy3
(7.3.15)
結果
MLE  
実行時間 -
コード長 3,347 bytes
コンパイル時間 169 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 557,888 KB
最終ジャッジ日時 2025-06-12 20:57:21
合計ジャッジ時間 5,846 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 10 MLE * 1 -- * 23
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from collections import deque

class Edge:
    def __init__(self, to, rev, capacity):
        self.to = to
        self.rev = rev
        self.capacity = capacity

class Dinic:
    def __init__(self, n):
        self.size = n
        self.graph = [[] for _ in range(n)]
    
    def add_edge(self, fr, to, cap):
        forward = Edge(to, len(self.graph[to]), cap)
        backward = Edge(fr, len(self.graph[fr]), 0)
        self.graph[fr].append(forward)
        self.graph[to].append(backward)
    
    def bfs_level(self, s, t, level):
        q = deque()
        level[:] = [-1] * self.size
        level[s] = 0
        q.append(s)
        while q:
            v = q.popleft()
            for edge in self.graph[v]:
                if edge.capacity > 0 and level[edge.to] == -1:
                    level[edge.to] = level[v] + 1
                    q.append(edge.to)
                    if edge.to == t:
                        return
    
    def dfs_flow(self, v, t, upTo, iter_, level):
        if v == t:
            return upTo
        for i in range(iter_[v], len(self.graph[v])):
            edge = self.graph[v][i]
            if edge.capacity > 0 and level[v] < level[edge.to]:
                d = self.dfs_flow(edge.to, t, min(upTo, edge.capacity), iter_, level)
                if d > 0:
                    edge.capacity -= d
                    self.graph[edge.to][edge.rev].capacity += d
                    return d
            iter_[v] += 1
        return 0
    
    def max_flow(self, s, t):
        flow = 0
        level = [-1] * self.size
        while True:
            self.bfs_level(s, t, level)
            if level[t] == -1:
                return flow
            iter_ = [0] * self.size
            while True:
                f = self.dfs_flow(s, t, float('inf'), iter_, level)
                if f == 0:
                    break
                flow += f
            level = [-1] * self.size

def main():
    H, W = map(int, sys.stdin.readline().split())
    A = [[] for _ in range(H+2)]  # 1-based to H
    for i in range(2, H):
        A[i] = list(map(int, sys.stdin.readline().split()))
    
    INF = 1 << 60
    total_nodes = 2 * H * W + 2
    dinic = Dinic(total_nodes)
    S = 0
    T = 2 * H * W + 1
    
    def in_node(i, j):
        return (i-1)*W + (j-1) + 1
    
    def out_node(i, j):
        return H * W + (i-1)*W + (j-1) + 1
    
    for i in range(1, H+1):
        for j in range(1, W+1):
            in_n = in_node(i, j)
            out_n = out_node(i, j)
            if i == 1 or i == H:
                dinic.add_edge(in_n, out_n, INF)
            else:
                a = A[i][j-1]
                if a == -1:
                    dinic.add_edge(in_n, out_n, INF)
                else:
                    dinic.add_edge(in_n, out_n, a)
            for di, dj in [(-1,0), (1,0), (0,-1), (0,1)]:
                ni = i + di
                nj = j + dj
                if 1 <= ni <= H and 1 <= nj <= W:
                    dinic.add_edge(out_n, in_node(ni, nj), INF)
    
    for j in range(1, W+1):
        dinic.add_edge(S, in_node(1, j), INF)
    
    for j in range(1, W+1):
        dinic.add_edge(out_node(H, j), T, INF)
    
    max_flow = dinic.max_flow(S, T)
    if max_flow >= INF:
        print(-1)
    else:
        print(max_flow)

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