結果

問題 No.2573 moving up
ユーザー mymelochanmymelochan
提出日時 2023-12-02 17:06:15
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,350 ms / 2,000 ms
コード長 2,510 bytes
コンパイル時間 261 ms
コンパイル使用メモリ 82,324 KB
実行使用メモリ 89,856 KB
最終ジャッジ日時 2024-09-27 01:28:45
合計ジャッジ時間 14,454 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 87 ms
76,672 KB
testcase_01 AC 723 ms
88,984 KB
testcase_02 AC 771 ms
89,216 KB
testcase_03 AC 943 ms
89,472 KB
testcase_04 AC 908 ms
89,856 KB
testcase_05 AC 923 ms
89,856 KB
testcase_06 AC 1,350 ms
89,400 KB
testcase_07 AC 897 ms
89,216 KB
testcase_08 AC 177 ms
79,400 KB
testcase_09 AC 892 ms
85,888 KB
testcase_10 AC 685 ms
87,552 KB
testcase_11 AC 217 ms
80,900 KB
testcase_12 AC 415 ms
84,992 KB
testcase_13 AC 751 ms
88,936 KB
testcase_14 AC 130 ms
78,720 KB
testcase_15 AC 74 ms
74,752 KB
testcase_16 AC 150 ms
78,976 KB
testcase_17 AC 401 ms
83,572 KB
testcase_18 AC 296 ms
82,056 KB
testcase_19 AC 574 ms
87,084 KB
testcase_20 AC 166 ms
79,872 KB
testcase_21 AC 166 ms
79,104 KB
testcase_22 AC 278 ms
81,588 KB
testcase_23 AC 175 ms
79,744 KB
testcase_24 AC 251 ms
81,664 KB
testcase_25 AC 443 ms
84,604 KB
testcase_26 AC 173 ms
79,772 KB
testcase_27 AC 48 ms
62,336 KB
testcase_28 AC 49 ms
62,080 KB
testcase_29 AC 49 ms
62,592 KB
testcase_30 AC 49 ms
63,616 KB
権限があれば一括ダウンロードができます

ソースコード

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):
        if y-j >= 0:
            c = max(y-j,x)
        else:
            c = j-y+x
        #print(i,j,c,x,y)
        mcf.add_edge(i,W+j,1,c)

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