結果

問題 No.2573 moving up
ユーザー AngrySadEightAngrySadEight
提出日時 2023-12-01 09:03:48
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,169 ms / 2,000 ms
コード長 2,539 bytes
コンパイル時間 241 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 89,832 KB
最終ジャッジ日時 2023-12-06 15:48:40
合計ジャッジ時間 17,204 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 94 ms
76,468 KB
testcase_01 AC 776 ms
88,908 KB
testcase_02 AC 805 ms
88,952 KB
testcase_03 AC 935 ms
89,832 KB
testcase_04 AC 885 ms
89,716 KB
testcase_05 AC 897 ms
89,620 KB
testcase_06 AC 1,169 ms
89,336 KB
testcase_07 AC 812 ms
89,212 KB
testcase_08 AC 176 ms
78,916 KB
testcase_09 AC 865 ms
85,208 KB
testcase_10 AC 701 ms
87,364 KB
testcase_11 AC 233 ms
80,020 KB
testcase_12 AC 426 ms
83,716 KB
testcase_13 AC 835 ms
88,528 KB
testcase_14 AC 145 ms
78,172 KB
testcase_15 AC 85 ms
76,712 KB
testcase_16 AC 165 ms
78,176 KB
testcase_17 AC 425 ms
82,792 KB
testcase_18 AC 306 ms
81,912 KB
testcase_19 AC 642 ms
86,820 KB
testcase_20 AC 197 ms
78,928 KB
testcase_21 AC 178 ms
78,904 KB
testcase_22 AC 297 ms
81,020 KB
testcase_23 AC 185 ms
79,204 KB
testcase_24 AC 269 ms
80,892 KB
testcase_25 AC 476 ms
84,604 KB
testcase_26 AC 194 ms
79,088 KB
testcase_27 AC 52 ms
63,516 KB
testcase_28 AC 51 ms
63,516 KB
testcase_29 AC 51 ms
63,516 KB
testcase_30 AC 52 ms
66,136 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# Primal-Dual: https://tjkendev.github.io/procon-library/python/min_cost_flow/primal-dual.html
from heapq import heappush, heappop
from collections import deque


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


INF = 10 ** 17 + 1

H, W = map(int, input().split())
dists = [[INF for _ in range(W)] for _ in range(W)]
dist = [[INF for _ in range(H + W)] for _ in range(H)]
dq = deque()
dx = [-1, -1, 0, 0, 1, 1]
dy = [-1, 0, -1, 1, 0, 1]

for i in range(W):
    x, y = map(int, input().split())
    x -= 1
    y -= 1
    for j in range(W):
        if y < j:
            dists[i][j] = (j - y) + x
        elif y > j + x:
            dists[i][j] = (y - (j + x)) + x
        else:
            dists[i][j] = x
# print(dists)

graph = MinCostFlow(2 * W + 2)
for i in range(W):
    graph.add_edge(2 * W, i, 1, 0)
    graph.add_edge(W + i, 2 * W + 1, 1, 0)
for i in range(W):
    for j in range(W):
        graph.add_edge(i, W + j, 1, dists[i][j])
ans = graph.flow(2 * W, 2 * W + 1, W)
print(ans)
0