結果

問題 No.2573 moving up
ユーザー 👑 rin204
提出日時 2023-12-10 18:11:28
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 168 ms / 2,000 ms
コード長 1,626 bytes
コンパイル時間 229 ms
コンパイル使用メモリ 82,456 KB
実行使用メモリ 76,544 KB
最終ジャッジ日時 2024-09-27 04:08:35
合計ジャッジ時間 3,821 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 31
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

def Hungarian(A, inf=1 << 60):
n = len(A) + 1
m = len(A[0]) + 1
P = [0] * m
way = [0] * m
U = [0] * n
V = [0] * m
for i in range(1, n):
P[0] = i
minV = [inf] * m
used = [False] * m
j0 = 0
while P[j0] != 0:
i0 = P[j0]
j1 = 0
used[j0] = True
delta = inf
for j in range(1, m):
if used[j]:
continue
if i0 == 0 or j == 0:
cur = -U[i0] - V[j]
else:
cur = A[i0 - 1][j - 1] - U[i0] - V[j]
if cur < minV[j]:
minV[j] = cur
way[j] = j0
if minV[j] < delta:
delta = minV[j]
j1 = j
for j in range(m):
if used[j]:
U[P[j]] += delta
V[j] -= delta
else:
minV[j] -= delta
j0 = j1
P[j0] = P[way[j0]]
while j0 != 0:
j1 = way[j0]
P[j0] = P[j1]
j0 = j1
ret = [-1] * (n - 1)
for j in range(1, m):
if P[j] != 0:
ret[P[j] - 1] = j - 1
return -V[0], ret
h, w = map(int, input().split())
ans = 0
A = [[0] * w for _ in range(w)]
for i in range(w):
x, y = map(int, input().split())
x -= 1
y -= 1
ans += x
l = y - x
r = y
for j in range(w):
if j < l:
A[i][j] = l - j
elif j > r:
A[i][j] = j - r
res = Hungarian(A)
print(res[0] + ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0