結果

問題 No.2573 moving up
コンテスト
ユーザー mymelochan
提出日時 2023-12-02 16:59:50
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,483 bytes
コンパイル時間 283 ms
コンパイル使用メモリ 82,152 KB
実行使用メモリ 89,756 KB
最終ジャッジ日時 2024-09-26 21:00:02
合計ジャッジ時間 13,436 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 22 WA * 9
権限があれば一括ダウンロードができます

ソースコード

diff # 

#############################################################

import sys
sys.setrecursionlimit(10**7)

from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations
from math import sin,cos
#from math import isqrt #DO NOT USE PyPy

ipt = sys.stdin.readline
iin = lambda :int(ipt())
lmin = lambda :list(map(int,ipt().split()))


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

        while f:
            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))
            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

#############################################################

H,W = lmin()
L = [lmin() for _ in range(W)]

mcf = MinCostFlow(2+W*2)
start = W*2
end = W*2+1

for i in range(W):
    mcf.add_edge(start,i,1,0)
    mcf.add_edge(W+i,end,1,0)
    x,y = L[i]
    x,y = x-1,y-1
    for j in range(W):
        a1,a2 = abs(0-x),abs(j-y)
        c = max(a1,a2)
        #print(i,j,c,x,y)
        mcf.add_edge(i,W+j,1,c)

print(mcf.flow(start,end,W))
0