#933002 (PyPy3) No.2573 moving up

• 問題: No.2573 moving up
• ユーザー: 👑 AngrySadEight
• 提出日時: 2023-12-01 09:03:48
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 1,155 ms / 2,000 ms
• コード長: 2,539 bytes
• コンパイル時間: 248 ms
• コンパイル使用メモリ: 82,176 KB
• 実行使用メモリ: 90,260 KB
• 最終ジャッジ日時: 2024-09-27 01:27:47
• 合計ジャッジ時間: 14,791 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
other	AC * 31

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
# 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)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX